当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
The game of Crosses and Crosses is played on the field of 1 × n cells. Two players make moves in turn. Each move the player selects any free cell on the field and puts a cross ‘×’ to it. If after the player’s move there are three crosses in a row, he wins.
You are given n. Find out who wins if both players play optimally.
Input file contains one integer number n (3 ≤ n ≤ 2000).
Output ‘1’ if the first player wins, or ‘2’ if the second player does.
| #1 | 3 |
|---|---|
| #2 | 6 |
| #1 | 1 |
|---|---|
| #2 | 2 |
| Case time limit(单组数据时间限制) | 2000MS |
| 时间上限 | 内存上限 |
| 3000 | 65536 |