Time Limit: 500MS | | Memory Limit: 65536KB | | 64bit IO Format: %I64d & %I64u |
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
The professor have chosen the field size n
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;
}
