Natus ad codicem#12197
A permutation of length is an array p=[p_1,p_2,\dots,p_n], which contains every integer from to (inclusive) and each number appears exactly once. For example, p=[3,1,4,2,5] is a permutation of length .
Given an integer , construct an array of integers between and with length such that the number of subsegments that are permutations is not less than \lfloor \frac{3n}{2} \rfloor-1.
The first and only line contains one integer (1 \le n \le 3000).
Output integers between and — the elements of your array. If there are multiple arrays with the maximum number of such subsegments, you can output any of them.
Example 1
There are good subsegments:
[2,1,3]
It could be proven that there is no better array.
( points): n = 1
( points): n = 2;
( points): n \le 8;
( points): no additional constraints