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):


import re
import math
from collections import defaultdict,deque,Counter
from fractions import Fraction
import bisect
import itertools
from itertools import accumulate
from copy import deepcopy
import heapq
import random
import time
import os
import sys
from functools import lru_cache,reduce
readline=sys.stdin.readline
sys.setrecursionlimit(100000)
alp="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Set():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(bool)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        if not self.find(x):
            heapq.heappush(self.heap,x)
            self.dic[x]=True
            self.size+=1

    def remove(self,x):
        if self.find(x):
            self.dic[x]=False
            self.size-=1

    def find(self,x):
        return self.dic[x]
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==False:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class multiset():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(int)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        heapq.heappush(self.heap,x)
        self.dic[x]+=1
        self.size+=1

    def remove(self,x):
        if self.dic[x]>0:
            self.dic[x]-=1
            self.size-=1
    
    def count(self,x):
        return self.dic[x]

    def find(self,x):
        return self.dic[x]>0
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==0:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):print("yes" if b else "no")
def Yn(b):print("Yes" if b else "No")
def YN(b):print("YES" if b else "NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(b,t,f):return t if b else f
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def inputintlist(row=1): 
    if row==1:
        ret=list(map(int,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=int(input())
    return ret
def inputfloatlist(row=1): 
    if row==1:
        ret=list(map(float,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=float(input())
    return ret
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def getmd(x1,y1,x2,y2):return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow
def zipsort(*args):
    ziplist=sorted(zip(*args))
    for a in range(len(args)):
        for b in range(len(ziplist)):
            args[a][b]=ziplist[b][a]
def zipreverse(*args):
    ziplist=list(zip(*args))
    rev=[]
    for a in range(len(ziplist)-1,-1,-1):
        rev.append(ziplist[a])
    for a in range(len(args)):
        for b in range(len(rev)):
            args[a][b]=rev[b][a]

def to10(A):
    ret=0
    for a in range(len(A)-1,-1,-1):
        ret+=X[a]*2**(N-1-a)
    return ret



x=int(input())
L=[8,7,6,5,4,3,2,1]
x-=400
x//=200
print(L[x])

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

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

if x <= 599:
    print(8)
elif x <= 799:
    print(7)
elif x <= 999:
    print(6)
elif x <= 1199:
    print(5)
elif x <= 1399:
    print(4)
elif x <= 1599:
    print(3)
elif x <= 1799:
    print(2)
else:
    print(1)

Solution (Python):

import sys
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
from itertools import accumulate

sys.setrecursionlimit(10**6)
INF = 10**12
m = 10**9 + 7

def main():
    X = int(input())
    X -= 400
    print(8 - X//200)

if __name__ == "__main__":
    main()

Solution (Python):
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)
elif X < 2000:
    print(1)

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

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)
else:
    print(1)

Solution (Python):
def main():
    from sys import setrecursionlimit, stdin, stderr
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**18+10

    x = II()
    print(8-(x -400)//200) 

    
main()

Solution (Python):
X = int(input())
if X>=1800:
    print(1)
elif X>=1600:
    print(2)
elif X>=1400:
    print(3)
elif X>=1200:
    print(4)
elif X>=1000:
    print(5)
elif X>=800:
    print(6)
elif X>=600:
    print(7)
elif X>=400:
    print(8)

Solution (Python):
import sys
import math
import bisect

def main():
    n = int(input())
    ans = 10 - n // 200
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
import io
import os

from collections import Counter, defaultdict, deque


def solve(X,):
    if X < 600:
        return 8
    if X < 800:
        return 7
    if X < 1000:
        return 6
    if X < 1200:
        return 5
    if X < 1400:
        return 4
    if X < 1600:
        return 3
    if X < 1800:
        return 2

    if X < 2000:
        return 1
    assert False


if __name__ == "__main__":
    input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
    (X,) = [int(x) for x in input().split()]
    ans = solve(X,)
    print(ans)

Solution (Python):
import sys


def handler():
    x = int(input().strip())
    sys.stdout.write('%d\n' % (10 - x // 200))


def main():
    while True:
        try:
            handler()
        except ValueError:
            continue
        except EOFError:
            break


if __name__ == '__main__':
    main()

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

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

Solution (Python):
if __name__ == "__main__":
    n = int(input())
    print(10-n//200)

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do(): 
    n=INT()
    if n<=599:
        print(8)
    elif n<=799:
        print(7)
    elif n<=999:
        print(6)
    elif n<=1199:
        print(5)
    elif n<=1399:
        print(4)
    elif n<=1599:
        print(3)
    elif n<=1799:
        print(2)
    else:
        print(1)
if __name__ == '__main__':
    do()

Solution (Python):
X=int(input())
print((1999-X)//200+1)

Solution (Python):

r = [600,800,1000,1200,1400,1600,1800,2000]

x = int(input())

for i in range(len(r)):
    if x < r[i]:
        print(8-i)
        break

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

X = int(input())

ans = 10

print(ans - X // 200)

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

Solution (Python):






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

main()

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

print(10 - (x // 200))

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

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

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

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

print(10-int(X/200))

Solution (Python):


import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

X = int(input())
if X <= 599:
    print(8)
elif X <= 799:
    print(7)
elif X <= 999:
    print(6)
elif X <= 1199:
    print(5)
elif X <= 1399:
    print(4)
elif X <= 1599:
    print(3)
elif X <= 1799:
    print(2)
elif X <= 1999:
    print(1)

Solution (Python):
def examA():
    X = I()
    X -= 400
    ans = 8 - X//200
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

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

print(10 - (X // 200))

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

print(10-(X//200))

Solution (Python):
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)

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

Solution (Python):
x=int(input())
if x>=400 and x<=599:
    kyuu=8
elif x<=799:
    kyuu=7
elif x<=999:
    kyuu=6
elif x<=1199:
    kyuu=5
elif x<=1399:
    kyuu=4
elif x<=1599:
    kyuu=3
elif x<=1799:
    kyuu=2
elif x<=1999:
    kyuu=1
print(kyuu)

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

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

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

Solution (Python):
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)

Solution (Python):


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))


def resolve():
    N,=pin()

    print(10-N//200)

resolve()

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


X = ini()


def solve():
    if X < 600:
        return 8
    if X < 800:
        return 7
    if X < 1000:
        return 6
    if X < 1200:
        return 5
    if X < 1400:
        return 4
    if X < 1600:
        return 3
    if X < 1800:
        return 2
    return 1


print(solve())

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

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

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

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

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    X = I()

    print(10 - X // 200)

if __name__ == '__main__':
    resolve()

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

Solution (Python):
x=int(input())
for i in range(10):
    if 400+200*i <= x < 400+200*(i+1):
        print(8-i)
        break

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

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

Solution (Python):
import sys

def solve():
      input = sys.stdin.readline
      X = int(input()) // 200
      print(10 - X)

      return 0

if __name__ == "__main__":
      solve()

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

n=int(input())
print(10-n//200)

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

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

if X<=599:
  print(8)
elif X<=799:
  print(7)
elif X<=999:
  print(6)
elif X<=1199:
  print(5)
elif X<=1399:
  print(4)
elif X<=1599:
  print(3)
elif X<=1799:
  print(2)
else:
  print(1)

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()) // 200
print( 10 - n )

Solution (Python):


'''
Author: andyli
Time: 2020-07-25 19:57:00
'''

import os
from io import BytesIO, IOBase
import sys


def main():
    n = int(input())
    if n in range(400,600): print(8)
    elif n in range(600,800): print(7)
    elif n in range(800,1000): print(6)
    elif n in range(1000,1200): print(5)
    elif n in range(1200,1400): print(4)
    elif n in range(1400,1600): print(3)
    elif n in range(1600,1800): print(2)
    elif n in range(1800,2000): print(1)
    
    return



BUFSIZE = 1048576


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = 'x' in file.mode or 'r' not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b'\n') + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode('ascii'))
        self.read = lambda: self.buffer.read().decode('ascii')
        self.readline = lambda: self.buffer.readline().decode('ascii')


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip('\r\n')




if __name__ == '__main__':
    main()

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array





sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    if N <= 599:
        print(8)
    elif N <= 799:
        print(7)
    elif N <= 999:
        print(6)
    elif N <= 1199:
        print(5)
    elif N <= 1399:
        print(4)
    elif N <= 1599:
        print(3)
    elif N <= 1799:
        print(2)
    elif N <= 1999:
        print(1)


if __name__ == '__main__':
    main()

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

Solution (Python):
from sys import stdin
import sys
import math



s = int(input())
print(10-s//200)

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

Solution (Python):
import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))


def main():
	X = int(input())
	ans = int(X // 200)
	print(10 - ans)


if __name__ == '__main__':
	main()

Solution (Python):
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

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

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

x = ni()

print(10-x//200)

Solution (Python):

import sys
input = sys.stdin.readline

x = int(input())
print(10 - x //200)

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

x=II()
print(10-x//200)

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

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

if X<=599:
  print(8)
elif X<=799:
  print(7)
elif X<=999:
  print(6)
elif X<=1199:
  print(5)
elif X<=1399:
  print(4)
elif X<=1599:
  print(3)
elif X<=1799:
  print(2)
else:
  print(1)

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

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

print(8 - (X - 400) // 200)

Solution (Python):
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter

from functools import lru_cache

sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7


def inp():
    '''
    一つの整数
    '''
    return int(input())


def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))


def str_inp():
    '''
    文字列をリストとして読み込む
    '''
    return list(input()[:-1])


x = inp()
print(8 - (x - 400) // 200)

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

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

b = a//200

print(10-b)

Solution (Python):
x=int(input())
print((1999-x)//200+1)

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

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

Solution (Python):

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

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

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

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re












import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
x = I()
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):
N=int(input())
print(10-(N//200))

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

Solution (Python):
x = int(input())
print((1999-x)//200+1)

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

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

Solution (Python):


X = int(input())
l = [600, 800, 1000, 1200, 1400, 1600, 1800, 2000]
k = 8
for a in l:
    if X < a:
        print(k)
        exit()
    k -= 1

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

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

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

print(8-(X-400)//200)

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

Solution (Python):


a = int(input())

print(10-a//200)

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

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

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

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

print(8-X//200)

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

Solution (Python):


import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

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

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

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

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

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

if 400 <= x < 600:
    ans = '8'
elif 600 <= x < 800:
    ans = '7'
elif 800 <= x < 1000:
    ans = '6'
elif 1000 <= x < 1200:
    ans = '5'
elif 1200 <= x < 1400:
    ans = '4'
elif 1400 <= x < 1600:
    ans = '3'
elif 1600 <= x < 1800:
    ans = '2'
elif 1800 <= x < 2000:
    ans = '1'

print(ans)

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

    print(10 - X//200)


if __name__ == "__main__":
    main()

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

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

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

print(10-n//200)

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    x = I()
    print(8-((x//200)-2))
    return


if __name__ == "__main__":
    solve()