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


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

Solution (Python):
import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
while t > 0:
	t -= 1
	
	
	
	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):
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

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


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

Solution (Python):
a = int(input())
print((1999-a)//200+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)
elif 1800<=n and n<=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 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):
'''بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ'''

gi = lambda : list(map(int,input().split()))
r, = gi()
print(8 - (r - 400) // 2 // 100)

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


solve()

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


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

    return

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

Solution (Python):
import sys
range = xrange
input = raw_input

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

Solution (Python):
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()


x = readInt()

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

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

for i in range(8):
    low = i * 200 + 400
    high = low + 200
    if low <= X < high:
        print(8 - i)

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


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

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

def main():
    sys.setrecursionlimit(10**7)
    INF = 10**18
    MOD = 10**9 + 7
    LI = lambda : [int(x) for x in sys.stdin.readline().split()]
    _LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
    NI = lambda : int(sys.stdin.readline())
    SI = lambda : sys.stdin.readline().rstrip()


    x = NI()
    ans = 10 - x // 200

    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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

if __name__ == '__main__':
    main()

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):
def main():
    s = int(input())
    if s <= 599:
        print(8)
    else:
        print(10 - s//200)

    
if __name__ == '__main__':
    main()

Solution (Python):
X=int(input())
li=[400,600,800,1000,1200,1400,1600,1800,2000]
li2=[8,7,6,5,4,3,2,1,0]
for i in range(8):
    if li[i]<=X and X<li[i+1]:
        print(li2[i])
        exit()

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

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

n = min(1800, X)//200 

print(10-n)

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

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

x = int(sys.stdin.readline())

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

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

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

import math 






    






mod = int(1e9+7)

INF = 1<<50

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

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

if __name__=='__main__':
    main()

Solution (Python):



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

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 sys

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')

def solve():
    x = ni()
    print(8 - (x - 400) // 200)
    return

solve()

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

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

Solution (Python):

import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

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

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




import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

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

if 'doTest' not in globals():
    resolve()
    sys.exit()

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):
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

n = int(input())

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

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

Solution (Python):
import sys, math
from collections import defaultdict
from itertools import product
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

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

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]

def main():
    X = ii()
    X = X//100
    if 4 <= X < 6:
        print(8)
    elif 6 <= X < 8:
        print(7)
    elif 8 <= X < 10:
        print(6)
    elif 10 <= X < 12:
        print(5)
    elif 12 <= X < 14:
        print(4)
    elif 14 <= X < 16:
        print(3)
    elif 16 <= X < 18:
        print(2)
    elif 18 <= X < 20:
        print(1)

if __name__ == '__main__':
    main()

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

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

print(10 - s//200)

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

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

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

Solution (Python):


import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

def resolve():
    x = int(input())

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

if __name__ == "__main__":
    resolve()

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


def _main():
    X = int(input())
    _run(X)


if __name__ == "__main__":
    _main()

Solution (Python):
def main():
    x = int(input())
    if x >= 400 and x < 600:
        print(8)
    elif x >= 600 and x < 800:
        print(7)
    elif 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)
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):
def main():
    x = int(input())
    x //= 200
    print(10 - x)

if __name__ == '__main__':
    main()

Solution (Python):






X = int(input())





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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect, bisect_left, bisect_right

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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

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

Solution (Python):
def main():
    X=int(input())
    X=X//100
    print(10 - X//2)

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

Solution (Python):



def solve(*args: str) -> str:
    x = int(args[0])
    if 400 <= x <= 599:
        return '8'
    elif 600 <= x <= 799:
        return '7'
    elif 800 <= x <= 999:
        return '6'
    elif 1000 <= x <= 1199:
        return '5'
    elif 1200 <= x <= 1399:
        return '4'
    elif 1400 <= x <= 1599:
        return '3'
    elif 1600 <= x <= 1799:
        return '2'
    elif 1800 <= x <= 1999:
        return '1'
    return ''


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
input = sys.stdin.readline
INF = float("inf")



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

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


def main():
    for i in range(1, 9):
        t = 2000 - 200 * i
        if t <= X:
            print(i)
            return


if __name__ == "__main__":
    main()

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

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

if __name__ == "__main__":
    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):
def main() :
    n = int(input())

    if (n <= 599) :
        print(8)
        return
    
    if (n <= 799) :
        print(7)
        return
    
    if (n <= 999) :
        print(6)
        return

    if (n <= 1199) :
        print(5)
        return

    if (n <= 1399) :
        print(4)
        return

    if (n <= 1599) :
        print(3)
        return

    if (n <= 1799) :
        print(2)
        return

    if (n <= 1999) :
        print(1)
        return


main()

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_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)

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):
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 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, math, itertools, collections, bisect 
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8') 
inf = float('inf') ;mod = 10**9+7 
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

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

Solution (Python):
def resolve():
    x = int(input())
    ans = 0
    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)
resolve()

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

ans = 0
while X >= 200:
    X -= 200
    ans += 1
print(10-ans)

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

for i in range(0, 20):
    v = 400 + i * 200
    if v <= X < v + 200:
        print(8 - i)
        exit()

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
INF = 10**18


if __name__ == "__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)
    else:
        print(1)

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


print(10-x)

Solution (Python):

import sys, re
from decimal import *
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor, trunc, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = INT()

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

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

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

r = 0

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

print(r)