Odd Sum

Given an integer $N$, consider all arrays $A$ of size $N$ such that: - All the elements are non-negative and distinct. - All prefix sums are odd. Formally, for all $i$ such that $1 \le i \le N$, $\sum_{j=1}^i A_j$ is odd. Among all possible arrays $A$, output the smallest possible sum of the elements of the array. **Note**: Since the Input/Output may be large, it is preferred to use fast I/O.