You are given an integer \(N\). Construct an array of \(N\) distinct odd integers such that:

• The sum of all elements is exactly \(N \cdot (N+1)\)
• Each element \(A_i\) must satisfies the range constraint: \((1 \leq A_i \leq 5 \cdot 10^{6})\)

The only line contains a single integer \(N\) \((1 \leq N \leq 2 \cdot 10^{6})\)

If it's impossible to construct an array, then print \(-1\).
Otherwise, Print \(N\) space-separated distinct odd integers that satisfy the given conditions.. 

If there are multiple valid arrays, any one of them will be accepted.

Input copy	Output copy
4	3 5 1 11

In the example, the array \([3, 5, 1, 11]\) has length \(4\), all elements are distinct odd integers, and its sum is \(3 + 5 + 1 + 11 = 20\), which is exactly \(4 \cdot (4+1)\)

Other answers would also be accepted.