Problem:
 Score: 100 points    Problem Statement  M-kun is a competitor in AtCoder, whose highest rating is X . In this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999 , the following kyus are given:   From 400 through 599 : 8 -kyu  From 600 through 799 : 7 -kyu  From 800 through 999 : 6 -kyu  From 1000 through 1199 : 5 -kyu  From 1200 through 1399 : 4 -kyu  From 1400 through 1599 : 3 -kyu  From 1600 through 1799 : 2 -kyu  From 1800 through 1999 : 1 -kyu   What kyu does M-kun have?      Constraints   400 \leq X \leq 1999  X is an integer.         Input  Input is given from Standard Input in the following format:  X       Output  Print the kyu M-kun has, as an integer.
For example, if he has 8 -kyu, print 8 .        Sample Input 1 725      Sample Output 1 7  M-kun's highest rating is 725 , which corresponds to 7 -kyu. Thus, 7 is the correct output.       Sample Input 2 1600      Sample Output 2 2  M-kun's highest rating is 1600 , which corresponds to 2 -kyu. Thus, 2 is the correct output.

Solution (Python):
def main():
    X = int(input())

    a = X // 200
    print(10 - a)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print(8-(n-400)//200)

Solution (Python):
X=int(input())
ans=10
print(ans-X//200)

Solution (Python):
n = int(input())
print(10 - n // 200)

Solution (Python):
def main():
    x = int(input())
    if x < 600:
        print(8)
    elif x < 800:
        print(7)
    elif x < 1000:
        print(6)
    elif x < 1200:
        print(5)
    elif x < 1400:
        print(4)
    elif x < 1600:
        print(3)
    elif x < 1800:
        print(2)
    else:
        print(1)


if __name__ == '__main__':
    main()

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  
def LS2(): return list(sys.stdin.readline().rstrip())  

X = I()
if X < 600:
    print(8)
else:
    print(10-X//200)

Solution (Python):
x = int(input())
print(10-x//200)

Solution (Python):


import sys
read = sys.stdin.read
readline = sys.stdin.readline

x, = map(int, readline().split())

x //= 200
print(10-x)

Solution (Python):
n=int(input())
n=(n-400)//200
print(8-n)

Solution (Python):
x = int(input())
x = x//200

print(10-x)

Solution (Python):
n = int(input())
print(10-n//200)

Solution (Python):
x=int(input())
print(10-x//200)

Solution (Python):
n = int(input())
print(int(10-n//200))

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache





MOD = 10**9+7
INF = float('inf')
AZ = "abcdefghijklmnopqrstuvwxyz"






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n): return kaijo_memo[n]
  if(len(kaijo_memo) == 0): kaijo_memo.append(1)
  while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if n == r: return 1
  if n < r or r < 0: return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1: arr.append([temp, 1])
  if arr==[]: arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b: a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n-1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n: return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

def base_10_to_n_without_0(X, n):
  X -= 1
  if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]
  return [X%n]


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count




X = I()
print(10-X//200)

Solution (Python):
x = int(input())

k = x//200-1


print(9-k)

Solution (Python):
X = int(input())
print(10 - X // 200)

Solution (Python):


import sys
input=sys.stdin.readline

def main():
    X=int(input())
    X-=400
    X//=200
    print(8-X)
    
    
    
if __name__=="__main__":
    main()

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7 

from decimal import *



X = INT()
n = X//200

print(10-n)

Solution (Python):
a=int(input())
k=a//200
print(10-k)

Solution (Python):
x = int(input())
print(10 - (x // 200))

Solution (Python):
n = int(input())
a = n//200
print(10-a)

Solution (Python):
x = int(input())
if 400 <= x <= 599:
	print(8)
elif 600 <= x <= 799:
	print(7)
elif 800 <= x <= 999:
	print(6)
elif 1000 <= x <= 1199:
	print(5)
elif 1200 <= x <= 1399:
	print(4)
elif 1400 <= x <= 1599:
	print(3)
elif 1600 <= x <= 1799:
	print(2)
elif 1800 <= x <= 1999:
	print(1)

Solution (Python):
print(10-int(input())//200)

Solution (Python):
N = int(input())

print(10 - N // 200)

Solution (Python):
X=int(input())
print(10-X//200)

Solution (Python):
import sys
input=sys.stdin.readline

x=int(input())
y=(x-400)//200
print(8-y)

Solution (Python):
print(10-int(input())//200)

Solution (Python):
x=int(input())
print(10-x//200)

Solution (Python):
x=int(input())-400
print(8-x//200)

Solution (Python):
print(8-(int(input())-400)//200)

Solution (Python):
X = int(input())
print(10-X//200)

Solution (Python):
x = int(input())
print(10 - x // 200)

Solution (Python):
x=int(input())
print(10-(x//200))

Solution (Python):
N = int(input())

K = N//200

print(10 - K)

Solution (Python):
X = int(input())
print(8-(X-400)//200)

Solution (Python):
print(10-int(input())//200)

Solution (Python):
X = int(input())

t = X // 200

print(10 - t)

Solution (Python):
X=int(input())
print(10-(X//200))

Solution (Python):
x = int(input())
print(10-(x//200))

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
	return list(map(int,input().split()))
def m(): 
	return map(int,input().split())
def onem(): 
	return int(input())
def s(x): 
	a = []
	if len(x) == 0:
		return []
	aa = x[0]
	su = 1
	for i in range(len(x)-1):
		if aa != x[i+1]:
			a.append([aa,su])
			aa = x[i+1]
			su = 1
		else:
			su += 1
	a.append([aa,su])
	return a
def jo(x): 
	return " ".join(map(str,x))
def max2(x): 
	return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
	ll = 0
	rr = r
	while True:
		mid = (ll+rr)//2

	if rr == mid:
		return ll
	if (ここに評価入れる):
		rr = mid
	else:
		ll = mid+1
"""

n = onem()

po = n//200

print(10-po)

Solution (Python):
X = int(input())
a = 10-(X//200)
print(a)

Solution (Python):
i=int(input())
print(10-i//200)

Solution (Python):
X = int(input())
print(10 - X // 200)

Solution (Python):
x = int(input())
print(10 - x // 200)

Solution (Python):
from collections import deque
import math

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

n = int(input())
n //= 200

print(10-n)

Solution (Python):
X = int(input())
a = (X - 400) // 200
print(8 - a)

Solution (Python):
x = int(input())
print(10 - x // 200)

Solution (Python):
def main():
    X = int( input())
    print(10 - X//200)
if __name__ == '__main__':
    main()

Solution (Python):
X=[1800,1600,1400,1200,1000,800,600,400]
N=int(input())
for i in range(8):
  if N>=X[i]:
    print(i+1)
    break

Solution (Python):
X=int(input())
Y=X//200
print(10-Y)

Solution (Python):
X = int(input())

print(10 - X//200)

Solution (Python):
X = int(input())
a = X//200
print(10-a)

Solution (Python):
x = int(input())
print(10 - x // 200)

Solution (Python):
import sys
input = sys.stdin.readline


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


def main():
    X = readint()
    print(10 - X // 200)


if __name__ == "__main__":
    main()

Solution (Python):
x = int(input())
print(10 - x // 200)