Definite game

Description:
Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.

He came up with the following game. The player has a positive integer nn. Initially the value of nn equals to vv and the player is able to do the following operation as many times as the player want (possibly zero): choose a positive integer xx that x<nx<n and xx is not a divisor of nn, then subtract xx from nn. The goal of the player is to minimize the value of nn in the end.

Soon, Chouti found the game trivial. Can you also beat the game?

Input
The input contains only one integer in the first line: vv (1≤v≤1091≤v≤109), the initial value of nn.

Output
Output a single integer, the minimum value of nn the player can get.

Examples
Input
8
Output
1
Input
1
Output
1

Note
In the first example, the player can choose x=3x=3 in the first turn, then nn becomes 55. He can then choose x=4x=4 in the second turn to get n=1n=1 as the result. There are other ways to get this minimum. However, for example, he cannot choose x=2x=2 in the first turn because 22 is a divisor of 88.

In the second example, since n=1n=1 initially, the player can do nothing.

如果是2比较特殊，除此之外可以去x=n-1得到1。

#include<iostream>
using namespace std;
int main(){
	int n;
	cin>>n;
	if(n==2){
		cout<<"2"<<endl;
		return 0; 
	}
	cout<<"1"<<endl;
	return 0;
}