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 $n$. Initially the value of $n$ equals to $v$ and the player is able to do the following operation as many times as the player want (possibly zero): choose a positive integer $x$ that $x<n$ and $x$ is not a divisor of $n$, then subtract $x$ from $n$. The goal of the player is to minimize the value of $n$ 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: $v$ ($1 \le v \le 10^9$), the initial value of $n$.


-----Output-----

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


-----Examples-----
Input
8

Output
1

Input
1

Output
1



-----Note-----

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

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

Difficulty: interview

Starter code:

Solutions:
n=int(input())
if n==2:
    print(2)
else:
    print(1)

n = int(input())
if n == 2:
	print(2)
else:
	print(1)

n = int(input())
print(2 if n == 2 else 1)


n = int(input())
if n==2:print(2)
else:print(1)

n = int(input())
if n == 2:
    print(2)
else:
    print(1)

n = int(input())
if n == 2:
    print(2)
else:
    print(1)


n = int(input())

if n!=2:
	print(1)
else:
	print(2)

n = int(input())

if n != 2:
    print(1)
else:
    print(2)

import sys
from math import ceil, floor

input = sys.stdin.readline

n = int(input())

if (n == 2):
    print(2)
else:
    print(1)

n = int(input())

if n == 2:
    print(2)
else:
    print(1)


n = int(input())
print(2 if n == 2 else 1)

from sys import stdin, stdout
from math import sin, tan, cos, pi, atan2, sqrt, acos, atan, factorial
from random import randint

n = int(stdin.readline())
if n == 2:
    stdout.write(str(n))
else:
    stdout.write(str('1'))

n=int(input())
if (n==2):
	print (2)
else:
	print (1)

n = int(input())
if n == 2:
    print(2)
else:
    print(1)

n = int(input())

if n == 2:
	print(2)
else:
	print(1)

v = int(input())

if v in [2]:
	print("2")
else:
	print("1")

v = int(input())
if v == 2: print(v)
else:print(1)

n = int(input())
if n == 2:
    print(2)
else:
    print(1)

n = int(input())
if n == 2:
    print(2)
else:
    print(1)

#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=int(input())
if(t==2):
    print(2)
else:
    print(1)
    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

from sys import stdin
n=int(stdin.readline().strip())
if n!=2:
    print(1)
else:
    print(2)


n = int(input())
if n == 2:
    print(2)
else:
    print(1)

def mi():
	return list(map(int, input().split()))
'''
8
'''
n = int(input())
if n<=2:
	print (n)
else:
	print(1)


n = int(input())
if n == 2:
    print(2)
else:
    print(1)


if int(input()) == 2:
    print(2)
else:
    print(1)