CF630R.Game

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

There is a legend in the IT City college. A student that failed to answer all questions on the game theory exam is given one more chance by his professor. The student has to play a game with the professor.

The game is played on a square field consisting of $n×n$ cells. Initially all cells are empty. On each turn a player chooses and paint an empty cell that has no common sides with previously painted cells. Adjacent corner of painted cells is allowed. On the next turn another player does the same, then the first one and so on. The player with no cells to paint on his turn loses.

The professor have chosen the field size $n$ and allowed the student to choose to be the first or the second player in the game. What should the student choose to win the game? Both players play optimally.

输入格式

The only line of the input contains one integer $n$ ( $1<=n<=10^{18}$ ) — the size of the field.

输出格式

Output number 1, if the player making the first turn wins when both players play optimally, otherwise print number 2.

输入输出样例

输入#1
```
1
```
输出#1
```
1
```
输入#2
```
2
```
输出#2
```
2
```

首页