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

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')
elif N >= 400:
    print('8')

Solution (Python):

import os
from sys import stdin, stdout


def solve(tc):
    x = int(stdin.readline().strip())
    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)
    return

tcs = 1
tc = 1
while tc <= tcs:
    solve(tc)
    tc += 1

Solution (Python):
T=int(input())
if T>=400 and T<=599: print(8)
if T>=600 and T<=799: print(7)
if T>=800 and T<=999: print(6)
if T>=1000 and T<=1199: print(5)
if T>=1200 and T<=1399: print(4)
if T>=1400 and T<=1599: print(3)
if T>=1600 and T<=1799: print(2)
if T>=1800 and T<=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):
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 < 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 sys
input = sys.stdin.readline

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

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

Solution (Python):
import sys
import math
from collections import deque
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):
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
import numpy as np


def solve(X: int):
    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)

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

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


def main():
    input = sys.stdin.buffer.readline
    x = int(input())
    ans = 0
    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
    elif x <= 1999:
        ans = 1
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
X = int(input())
ans = 0
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
else:
    ans = 1
print(ans)

Solution (Python):





import sys
import heapq

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
x = int(input())
n=8
for i in range(600, 2001, 200):
    if x < i:
        print(n)
        exit()
    else:
        n-=1

Solution (Python):
from sys import stdin
N = int(stdin.readline().rstrip())
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)
else:
    print(1)

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

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

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

print((1999-n)//200+1)

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

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

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

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())
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):
if __name__ == "__main__":
    x=input()
    x=int(x)
    print(8-int((x-400)/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")
else:
  print("1")

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

kyu = [200 * i for i in range(9, 0, -1)]

for i, k in enumerate(kyu, 1):
    if X >= k:
        print(i)
        exit()

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 math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd 
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) 


x = int(input())
ans = 1
if x < 1800:
    ans = 2
if x < 1600:
    ans = 3
if x < 1400:
    ans = 4
if x < 1200:
    ans = 5
if x < 1000:
    ans = 6
if x < 800:
    ans = 7
if x < 600:
    ans = 8
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 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):
x=int(input())
xn=(x-400)//200
print(-xn+8)

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
from math import sqrt, pi
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right

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





X = getN()

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())
r = X//200
print(10-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):
def main():
	n = int(input())
	if 400 <= n <= 599:
		print(str(8))
	elif 600 <= n <= 799:
		print(str(7))
	elif 800 <= n <= 999:
		print(str(6))
	elif 1000 <= n <= 1199:
		print(str(5))
	elif 1200 <= n <= 1399:
		print(str(4))
	elif 1400 <= n <= 1599:
		print(str(3))
	elif 1600 <= n <= 1799:
		print(str(2))
	elif 1800 <= n <= 1999:
		print(str(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):
x=int(input())
if 400<=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 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")
    else:
        print("1")


if __name__ == "__main__":
    main()

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

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):
def resolve():
    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)

resolve()

Solution (Python):
X = int(input())
print(10 - (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)
elif X>=1800 and X<=1999:
    print(1)

Solution (Python):



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

    for i in range(10):
        if x < 600 + 200*i:
            return 8 - i


print(main())

Solution (Python):
n = int(input())
cnt = 0
while n >= 0:
    n -= 200
    cnt += 1
print(11 - cnt)

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)
elif A >= 400:
    print(8)

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

def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

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

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


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):
import sys
input = sys.stdin.readline



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

for i in range(8):
    if X >= 1800 - 200 * i:
        print(i + 1)
        break

Solution (Python):

from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify

import itertools, bisect
import math, fractions
import sys, copy

def L(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline().rstrip())
def S(): return list(sys.stdin.readline().rstrip())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def LIR1(n): return [LI1() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
def LR(n): return [L() for _ in range(n)]

alphabets = "abcdefghijklmnopqrstuvwxyz"

sys.setrecursionlimit(1000000)
dire = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
MOD = 1000000007

def main():
    X = I()
    for i in range(2, 11):
        if i * 200 <= X < (i + 1) * 200:
            print(10 - i)

if __name__ == '__main__':
    main()

Solution (Python):

import numpy as np
import sys
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect
from scipy.special import comb
import copy
sys.setrecursionlimit(10**6)


def zz():
    return list(map(int, sys.stdin.readline().split()))


def z():
    return int(sys.stdin.readline())


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


def C(line):
    return [sys.stdin.readline() for _ in range(line)]


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

Solution (Python):




import numpy as np

def int_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(input()))
    return np.array(x)

X = int(input())

a = 8
for i in range(2,11):
    if 200*i <= X and 200*(i+1) > X:
        print(a)
    a -= 1

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

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


import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

X = int(readline())

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

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

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

print(ret)

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

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

print(10 - X // 200)

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

if (400<=n) and (n<600):
  print(8)
elif (600<=n) and (n<800):
  print(7)
elif (800<=n) and (n<1000):
  print(6)
elif (1000<=n) and (n<1200):
  print(5)
elif (1200<=n) and (n<1400):
  print(4)
elif (1400<=n) and (n<1600):
  print(3)
elif (1600<=n) and (n<1800):
  print(2)
elif (1800<=n) and (n<2000):
  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):
n = int(input())
print((1999-n)//200+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):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")

INF = float("inf")


X = int(input())
y = X // 100
if y <= 5:
    print(8)
elif y <= 7:
    print(7)
elif y <= 9:
    print(6)
elif y <= 11:
    print(5)
elif y <= 13:
    print(4)
elif y <= 15:
    print(3)
elif y <= 17:
    print(2)
else:
    print(1)

Solution (Python):
import os
import sys
from io import BytesIO, IOBase






def main():
    t = 1
    for _ in range(t):
        n = int(input())
        count = 8
        for i in range(400, 2000, 200):
            if i <= n <= i + 200 - 1:
                print(count)
                break
            count -= 1
        
        
        





































BUFSIZE = 8192
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)
input = lambda: sys.stdin.readline().rstrip("\r\n")

 
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):
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)
elif n >= 400: print(8)

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

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

Solution (Python):
from collections import defaultdict,deque
import math
def gcd(a,b):
    return b if not a%b else gcd(b,a%b)
def lcm(a,b):
    return (a*b)//gcd(a,b)

def main():
    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)
    elif(n>=400):
        print(8)

if __name__ == '__main__':
    main()