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 sys
input = sys.stdin.readline
import numpy as np

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

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

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

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

x = I()

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

print(result)

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

print(10 - N // 200)

Solution (Python):

"""
Created on Sat Jul 25 20:59:38 2020

@author: NEC-PCuser
"""

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):
def solve():
    X = int(input())
    lower = 400
    upper = 599
    rank = 8
    for _ in range(8):
        if lower <= X <= upper:
            print(rank)
            return
        
        lower += 200
        upper += 200
        rank -= 1

if __name__ == '__main__':
    solve()

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

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

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())
c = 1
if x < 600:
    c = 8
elif x < 800:
    c = 7
elif x < 1000:
    c = 6
elif x < 1200:
    c = 5
elif x < 1400:
    c = 4
elif x < 1600:
    c = 3
elif x < 1800:
    c = 2
print(c)

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())
x = int((x-400)/200)
print(8 - x)

Solution (Python):
x = int(input())
y = [1800 - 200 * i for i in range(8)]
for i in range(8):
    if y[i] <= x:
        print(i + 1)
        break

Solution (Python):
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]

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

Solution (Python):

import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


import sys


buff_readline = sys.stdin.readline
readline = sys.stdin.readline

INF = 2**62-1


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))


def read_float():
    return float(buff_readline())


def read_float_n():
    return list(map(float, buff_readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()

def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(X):
    if X >= 1800:
        return 1
    elif X >= 1600:
        return 2
    elif X >= 1400:
        return 3
    elif X >= 1200:
        return 4
    elif X >= 1000:
        return 5
    elif X >= 800:
        return 6
    elif X >= 600:
        return 7
    return 8


def main():
    X = read_int()
    print(slv(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())




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

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

rank = {i: j for i, j in zip(range(2, 10), range(8, 0, -1))}
print(rank[x // 200])

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

Solution (Python):
def resolve():
    n=int(input())
    print(10-(n//100)//2)
resolve()

Solution (Python):
import sys

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

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

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())
print(8-(x-400)//200)

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x = I()
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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    x = int(readline())
    kyu = 0

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

    print(kyu)


if __name__ == '__main__':
    main()

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

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())
kyu = 8-((X-400)//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)
elif X < 2000:
    print(1)

Solution (Python):
n = int(input())
if 400 <= 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)

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

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

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

if 400<=x<600:
  print(8)
if 600<=x<800:
  print(7)
if 800<=x<1000:
  print(6)
if 1000<=x<1200:
  print(5)
if 1200<=x<1400:
  print(4)
if 1400<=x<1600:
  print(3)
if 1600<=x<1800:
  print(2)
if 1800<=x<2000:
  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):
















production = True

import sys, math, collections

def input(f = 0, m = 0):

    if m > 0: return [input(f) for i in range(m)]
    else:
        l = sys.stdin.readline()[:-1]

        if f >= 10:
            u = False
            f = int(str(f)[-1])
        else: u = True

        if f == 0: p = [l]
        elif f == 1: p = list(map(int, l.split()))
        elif f == 2: p = list(map(float, l.split()))
        elif f == 3: p = list(l)
        elif f == 4: p = list(map(int, list(l)))
        elif f == 5: p = l.split()

        return p if u else p[0]

def out(l, f = 0, n = True):

    if f == 0: p = str(l)
    elif f == 1: p = " ".join(map(str, l))
    elif f == 2: p = "\n".join(map(str, l))
    elif f == 3: p = "".join(map(str, l))

    print(p, end = "\n" if n else "")

def log(*args):
    if not production:
        print("$$$", end = "")
        print(*args)

enu = enumerate
ter = lambda a, b, c: b if a else c
ceil = lambda a, b: -(-a // b)
flip = lambda a: (a + 1) & 1

def mapl(i, f = 0):

    if f == 0: return list(map(int, i))
    elif f == 1: return list(map(str, i))
    elif f == 2: return list(map(list, i))






def solve():

    n = input(11)

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

    out(a)
        

    return


solve()

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):
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 1400 <= n and n <= 1599:
    print("3")
elif 1600 <= n and n <= 1799:
    print("2")
else:
    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())
for i in range(1,9):
  if x >= 200*(10-i):
    print(i)
    break

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

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

Solution (Python):
def resolve():
    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__":
    resolve()

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

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):
def main():
    X = int(input())
    X = (X - 400) // 200
    return 8 - X

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

Solution (Python):
print(10-int(input())//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 < 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():
    M=int(input())
    print(8-((M-400)//200))
main()

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


l = [400, 600, 800, 1000, 1200, 1400, 1600, 1800, 2000]
for i in range(len(l) - 1):
    if X >= l[i] and X < l[i+1]:
        ans = 8 - i
        break
print(ans)

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

ans = (2199-x)//200

print(ans)

Solution (Python):
import sys

sys.setrecursionlimit(1000000)

import bisect
import math
import collections
import heapq


def solve(N):
    i = 8
    n = 400
    while i > 0:
        if N < 200 + n + (200 * (8 - i)):
            return str(i)
        i -= 1


if __name__ == "__main__":

    N = int(input())
    print(solve(N))

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

result = 10 - (X//200)

print(result)

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

n=10-(x//200)

print(n)

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

def solve():
    X = int(readline())

    print(10 - X // 200)

solve()

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

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

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

Solution (Python):
import sys


def _i(): return int(sys.stdin.readline().strip())


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


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

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())
ans = 10-X//200
print(ans)

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

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

Solution (Python):
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

if __name__=='__main__':
    x = I()
    if 400<=x and 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)
    exit()

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
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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>=400 and x<=599:
  print(8)
if x>=600 and x<=799:
  print(7)
if x>=800 and x<=999:
  print(6)
if x>=1000 and x<=1199:
  print(5)
if x>=1200 and x<=1399:
  print(4)
if x>=1400 and x<=1599:
  print(3)
if x>=1600 and x<=1799:
  print(2)
if x>=1800 and 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())
if x <= 599:
  s = 8
elif x <= 799:
  s = 7
elif x <= 999:
  s = 6
elif x <= 1199:
  s = 5
elif x <= 1399:
  s = 4
elif x <= 1599:
  s = 3
elif x <= 1799:
  s = 2
elif x <= 1999:
  s = 1
print(s)

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


if __name__ == "__main__":
    main()

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

if X >= 400 and 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):


n = int(input())
arr = [[400,599],[600,799],[800,999],[1000,1199],[1200,1399],[1400,1599],[1600,1799],[1800,1999]]
arr = arr[-1::-1]
for i in range(len(arr)):
    if n>=arr[i][0] and n<=arr[i][1]:
        print(i+1)
        exit()

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

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

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())
if X<=1999 and 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())
for i in range(3, 11):
    if i * 200 > x:
        print(11 - i)
        exit()

Solution (Python):
if __name__ == '__main__':
    x = int(input())

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

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

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

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

Solution (Python):
import sys
import math


def input():
    return sys.stdin.readline().rstrip()


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):
def resolve():
    x = int(input())
    print((2199 - x) // 200)


if __name__ == '__main__':
    resolve()