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):
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):
x = int(input())

min_score = 400

for i in range(8):

    if 400 + 200 * i <= x < 400 + 200 * (i+1):
        print(8 - i)

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

rate = {
    400: '8',
    600: '7',
    800: '6',
    1000: '5',
    1200: '4',
    1400: '3',
    1600: '2',
    1800: '1',
}

print(rate[(x // 200) * 200])

Solution (Python):

MOD = 10 ** 9 + 7
INFI = 10**10

import math
from collections import deque
import itertools
import heapq

from fractions import Fraction
import copy
from functools import lru_cache
from collections import defaultdict
import pprint




def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default




def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)

def soinsubunkai(n):
    a = []
    i = 1
    while i*i <= n:
        if n % i == 0 and i!=1:
            a.append(i)
            n=n//i

        if n% i !=0 or i==1:
            i += 1
    nokori=[n]
    return a + nokori

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

def main():
    
    x=int(input())
    ans=8
    for i in range(8):
        if x >=400+200*i:
            ans=8-i
    print(ans)














if __name__ == "__main__":

    main()

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

Solution (Python):
import os
import sys
import math
import heapq
from decimal import *
from io import BytesIO, IOBase
from collections import defaultdict, deque

def r():
    return int(input())
def rm():
    return map(int,input().split())
def rl():
    return list(map(int,input().split()))

x=r()
if 400 <= x < 600:
    print(8)
elif 600 <= x < 800:
    print(7)
elif 800 <= x < 1000:
    print(6)
elif 1000 <= x < 1200:
    print(5)
elif 1200 <= x < 1400:
    print(4)
elif 1400 <= x < 1600:
    print(3)
elif 1600 <= x < 1800:
    print(2)
elif 1800 <= x < 2000:
    print(1)

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

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

Solution (Python):
def main():

    X = int(input())
    if 400 <= X < 600:
        return 8
    elif 600 <= X < 800:
        return 7
    elif 800 <= X < 1000:
        return 6
    elif 1000 <= X < 1200:
        return 5
    elif 1200 <= X < 1400:
        return 4
    elif 1400 <= X < 1600:
        return 3
    elif 1600 <= X < 1800:
        return 2
    elif 1800 <= X < 2000:
        return 1


if __name__ == '__main__':
    print(main())

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

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

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
import copy
x = int(input())





if 400 <= x < 600:
    print(8)
elif 600 <= x < 800:
    print(7)
elif 800 <= x < 1000:
    print(6)
elif 1000 <= x < 1200:
    print(5)
elif 1200 <= x < 1400:
    print(4)
elif 1400 <= x < 1600:
    print(3)
elif 1600 <= x < 1800:
    print(2)
else:
    print(1)

Solution (Python):
import bisect
import sys
import math
from collections import deque
from heapq import heappush, heappop

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


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


def isRaw():
    return list(map(int, ssRaw()))


INF = 1 << 29

DIV = (10**9) + 7


def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max, mod=DIV):
    fac, finv, inv = [0]*max, [0]*max, [0]*max
    fac[0] = fac[1] = 1
    finv[0] = finv[1] = 1
    inv[1] = 1
    for i in range(2, max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod - inv[mod % i] * (mod//i) % mod
        finv[i] = finv[i-1]*inv[i] % mod

    class CONV:
        def __init__(self):
            self.fac = fac
            self.finv = finv
            pass

        def ncr(self, n, k):
            if(n < k):
                return 0
            if(n < 0 or k < 0):
                return 0
            return fac[n]*(finv[k]*finv[n-k] % DIV) % DIV

    return CONV()


def cumsum(As):
    s = 0
    for a in As:
        s += a
        yield s


sys.setrecursionlimit(200005)


def dijkstra(G,start=0):
    heap = []
    cost = [INF]*len(G)
    heappush(heap,(0,start))
    while len(heap)!=0:
        c,n = heappop(heap)
        if cost[n] !=INF:
            continue
        cost[n]=c
        for e in G[n]:
            ec,v = e
            if cost[v]!=INF:
                continue
            heappush(heap,(ec+c,v))
    return cost


def main():
    X = iRaw()

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

main()

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

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):
x=int(input())



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

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain, product
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):
    return fs[n] * invs[n-k] * invs[k] % modp



class UnionFindEx:
    def __init__(self, size):
        
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


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




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

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
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


x = int(readline())

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

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

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 resolve():
    X = int(input())//200
    print(10-X)
    
resolve()

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

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

Solution (Python):
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
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 S(): return input()
def LS(): return input().split()


INF = float('inf')

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

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):
x = int(input())
ans = 10-x//200
print(ans)

Solution (Python):

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


main()

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

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

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

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

if 400 <= x < 600:
    print(8)
elif 600 <= x < 800:
    print(7)
elif 800 <= x < 1000:
    print(6)
elif 1000 <= x < 1200:
    print(5)
elif 1200 <= x < 1400:
    print(4)
elif 1400 <= x < 1600:
    print(3)
elif 1600 <= x < 1800:
    print(2)
else:
    print(1)

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

if 400 <= 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())
    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)


if __name__ == "__main__":
    main()

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

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

print(ans)

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

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)
elif x <= 1999:
    print(1)

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


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

ans=8
low=400
high=600
while ans>1:
    if low<=X<high:
        break
    else:
        low+=200
        high+=200
        ans-=1
print(ans)

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

if X>=400 and X<=599:
  print(8)
elif X>= 600 and X<=799:
  print(7)
elif X>= 800 and X<=999:
  print(6)
elif X>= 1000 and X<=1199:
  print(5)
elif X>= 1200 and X<=1399:
  print(4)
elif X>= 1400 and X<=1599:
  print(3)
elif X>= 1600 and X<=1799:
  print(2)
else:
  print(1)

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

x = int(input())

a = x - 400
b = a // 200
c = 8 - b

print(c)

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())
if 400<=x<600:
    print(8)
elif 600<=x<800:
    print(7)
elif 800<=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):
n=min(2000,input()+1)
print (2200-n)/200

Solution (Python):
x = int(input())
x -= 599
ans = 8
while True:
    if x > 0:
        ans -= 1
        x -= 200
    else:
        break
print(ans)

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):
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):
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):
n = int(input())
if (400<=n and n<=599):
    print(8)
elif (600<=n and n<=799):
    print(7)
elif (800<=n and n<=999):
    print(6)
elif (1000<=n and n<=1199):
    print(5)
elif (1200<=n and n<=1399):
    print(4)
elif (n<=1599):
    print(3)
elif (n<=1799):
    print(2)
else:
    print(1)

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())


def main():

    X = in_n()

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

    print(ans)


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

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

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

Solution (Python):

import sys


def solve(X: int):
    x = X - 400
    i = x//200
    print(8-i)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  
    solve(X)

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):
X = int(input())

print(8-((X-400)//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)
elif 1800 <= x <= 1999:
    print(1)

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

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

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):
n = int(input())


if n < 600:
    print(8)
elif n < 800:
    print(7)
elif n < 1000:
    print(6)
elif n < 1200:
    print(5)
elif n < 1400:
    print(4)
elif n < 1600:
    print(3)
elif n < 1800:
    print(2)
else:
    print(1)

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

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

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


print(10-(n//200))

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

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

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

def check(s):
    for i in range(len(s)):
        if s[i] != s[len(s)-1-i]:
            return False
    return True

def kyu(x):
    if x <= 599:
        return 8
    if x <= 799:
        return 7
    if x <= 999:
        return 6
    if x <= 1199:
        return 5
    if x <= 1399:
        return 4
    if x <= 1599:
        return 3
    if x <= 1799:
        return 2
    return 1

def main():
    x = ri()
    print(kyu(x))


if __name__ == '__main__':
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10**6)


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


if __name__ == '__main__':
    main(sys.stdin.readline, print)

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

Solution (Python):


x = int(input())
ans = 0

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

print(ans)

Solution (Python):


x = int(input())
x //= 200

print(10-x)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    x = int(input())
    res = 8 - (x - 400) // 200
    print(res)

if __name__ == '__main__':
    resolve()

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

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

main()

Solution (Python):
X=int(input())
r=[600,800,1000,1200,1400,1600,1800]

for i,num in enumerate(r):
    if X < num:
        ans = 8-i
        break
else:
    ans=1
    
print(ans)

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 defaultdict, Counter, namedtuple, deque
import itertools
import functools
import bisect
import heapq
import math
import copy


MOD = 10 ** 9 + 7



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

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")
elif x < 2000:
    print("1")

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)
else:
    assert False

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

if __name__ == "__main__":
    main()

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):
a = int(input())

b = a//200

print(10-b)

Solution (Python):
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
count = 0
ans = 0

X = int(input())

if X >= 400 and X < 600:
    print(8)
if X >= 600 and X < 800:
    print(7)
if X >= 800 and X < 1000:
    print(6)
if X >= 1000 and X < 1200:
    print(5)
if X >= 1200 and X < 1400:
    print(4)
if X >= 1400 and X < 1600:
    print(3)
if X >= 1600 and X < 1800:
    print(2)
if X >= 1800 and X < 2000:
    print(1)

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):
x=int(input())

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

Solution (Python):

a = int(input())

if a >=1800:
    print('1')
elif a >=1600:
    print('2')
elif a >=1400:
    print('3')
elif a >=1200:
    print('4')
elif a >=1000:
    print('5')
elif a >=800:
    print('6')
elif a >=600:
    print('7')
else:
    print('8')

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

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

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

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

for i in range(1, 9):
    if X >= 200*(10-i):
        print(i)
        break

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):
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):
x = int(input())
if 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):
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):
x = int(input())
ans = 8
if x <= 599:
    ans = 8
elif x <= 799:
    ans = 7
elif x <= 999:
    ans = 6
elif x <= 1199:
    ans = 5
elif x <= 1399:
    ans = 4
elif x <= 1599:
    ans = 3
elif x <= 1799:
    ans = 2
else:
    ans = 1
print(ans)

Solution (Python):
a = int(input())
ans = 8
for i in range(400, 12111, 200):

    if i <= a and a < i+200:
        print(ans)
        break
    ans -= 1

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

for i in range(8, 0, -1):
    j = 8 - i
    num = 400 + 200 * j
    if num <= x < num + 200:
        print(i)
        exit()

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

Solution (Python):
X = int(input())
Y = [1800,1600,1400,1200,1000,800,600,400]

for i, y in enumerate(Y):
    if X >= y:
        print(i + 1)
        exit()

Solution (Python):

X = int(input())

print(10 - X // 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())
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):
score=int(input())
print((2000-score+199)//200)

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

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

print(kyu)