CodeForces - 630R Game （规律）水

CodeForces
- 630R
Game

Time Limit: 500MS

Memory Limit: 65536KB

64bit IO Format: %I64d & %I64u

Submit Status

Description

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.

Input

The only line of the input contains one integer n (1 ≤ n ≤ 1018) —
the size of the field.

Output

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

Sample Input

Input

1

Output

1

Input

2

Output

2

Source
Experimental Educational Round: VolBIT Formulas Blitz

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#define INF 0x3f3f3f3f
#define ll long long
#define N 10010
#define M 1000000007
using namespace std;
int main()
{
ll n;
while(scanf("%lld",&n)!=EOF)
{
if(n&1)
printf("1\n");
else
printf("2\n");
}
return 0;
}