A permutation of integers $1,2,\ldots,n$ is called beautiful if there are no adjacent elements whose difference is $1$ .
Given $n$ , construct the lexicographically minimal beautiful permutation if such a permutation exists.
The only line contains an integer $n$ .
Print the lexicographically minimal beautiful permutation of integers $1,2,\ldots,n$ . If there is no such permutation, print "NO SOLUTION".