This is an interactive problem.
The playing field is a strip one cell wide and $$$n$$$ cells long. Two players take turns making moves. On each move, an empty cell is chosen and marked with a cross. It is forbidden for the field to contain more than two consecutive crosses. The player who has no legal move loses.
Write a program that plays against the jury's program. Your program must win all rounds. This is always possible, since you choose who makes the first move.
First, input an integer $$$n$$$ ($$$1 \le n \le 30$$$) — the length of the strip.
Next, decide who makes the first move. Output 1 if you move first; otherwise output 2. Then output a newline and flush the standard output buffer.
After that, your program must repeatedly do the following.
Example input-output:
| Input | Output |
| 4 | |
| 1 | |
| 4 | |
| 2 | |
| 1 | |
| 0 |
To flush the buffer use: