Annealing peaceful queens!#2764
Arrange queens on a square N \times N board so that no two attack each other — not a simple task. That is why it has been assigned to you.
The input consists of a single line containing the board size (4 \leq N \leq 200).
Print numbers : a_i is the number of the row on which you will place the queen occupying the -th column. The rows are numbered from bottom to top, from to (as on a standard chessboard).
Example 1