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.



Sample input:
725


Sample output:
7

Submission status: Accepted

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

Submission status: Accepted

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

    print((2000-x)//200 + 1 if x %200 != 0 else (2000-x)//200)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
x //= 100
x -= 4
x //= 2
print(8-x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def kyu_in_atcoder():
    X = int(input())
    lis = [10 - i for i in range(10)]
    x = X // 200
    print(lis[x])
kyu_in_atcoder()

Submission status: Accepted

Solution code:
x = int(input())

def check(input):
    one = 1800
    two = 1999
    kyu = 1
    while one >= 400:
        if one <= input <= two:
            return kyu
        kyu += 1
        one -= 200
        two -= 200

print(check(x))

Submission status: Accepted

Solution code:
# cook your dish here
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)
elif(n>=1800 and n<=1999):
    print(1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 1
# a,b=map(int,input().split())
# if a+b==15:
#     ans='+'
# elif a*b==15:
#     ans='*'
# else:
#     ans='x'
# print(ans)

# 2
X=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)
else:
    print(8)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)
else:
  print (8)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

print(10 - X // 200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
for i in range(8):
  if i*200+400<=x and i*200+599>=x:
    print(8-i)
    break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def kyuu(N):
  for i in range(8):
    if N >= 1800 - 200 * i:
      return (i + 1)
      break

X = int(input())
print(kyuu(X))

Submission status: Accepted

Solution code:
print([8,7,6,5,4,3,2,1][(int(input())-400) // 200 ])

Submission status: Accepted

Solution code:
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)
elif(n>=1800 and n<=1999):
    print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

n = 10- int(X/200)

print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.buffer.readline

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X = int(input())
b = 400
cnt = 8
 
a = (X - b) // 200
for i in range(1,9):
    a = (X - b) // 200
    if  0 <= a < 1:
        print(cnt)
        break
    else:
        cnt -= 1
        b += 200

Submission status: Accepted

Solution code:
print(8-(int(input())-400)//200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
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)
else :
    print(1)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = int(input())

for i in range(8):
    if (400+200*i) <= t <= (599 + 200*i):
        print(8-i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.buffer.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)
else:
    print(1)

Submission status: Accepted

Solution code:
x = int(input())
cnt = 6
while True:
    if x < cnt*100:
        break
    cnt += 2
print(int(11 - cnt / 2))

Submission status: Accepted

Solution code:
x = int(input())
for i in range(2,10):
  if 200*i <= x < 200*(i+1):
    print(10-i)

Submission status: Accepted

Solution code:
x = int(input())

for i in range(1, 9):
  if 200 + 200 * i <= x <= 399 + 200 * i:
    print(9 - i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(out)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


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


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


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


# Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
X = int(input())
MIN = 400
MAX = MIN + 199
for i in range(8):
  if MIN <= X and X <= MAX:
    print(8 - i)
    break
  MIN = MIN + 200
  MAX = MIN + 199

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
print((2199-n)//200)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys

input = iter(sys.stdin.read().splitlines()).__next__

sys.setrecursionlimit(10000)

R = int(input())

res = -1
if R <= 599:
   res = 8
elif R <= 799:
   res = 7
elif R <= 999:
   res = 6
elif R <= 1199:
   res = 5
elif R <= 1399:
   res = 4
elif R <= 1599:
   res = 3
elif R <= 1799:
   res = 2
elif R <= 1999:
   res = 1

   
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
b=a//200
if b==2:
  print(8)
elif b==3:
  print(7)
elif b==4:
  print(6)
elif b==5:
  print(5)
elif b==6:
  print(4)
elif b==7:
  print(3)
elif b==8:
  print(2)
elif b==9:
  print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineering College

'''
from os import path
import sys
from heapq import heappush,heappop,heapify
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input().rstrip()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007
# mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

def b(i):
    # ord(i) -> Ascii value of i
    return ord(i)-ord('a')

file = 1


def solve():


    x=[599,799,999,1199,1399,1599,1799,1999]
 
    n=ii()
    for i in range(8):
        if n<=x[i]:
            print(8-i)
            break





        

        



    










        
if __name__ =="__main__":

    if(file):

        if path.exists('input.txt'):
            sys.stdin=open('input.txt', 'r')
            sys.stdout=open('output.txt','w')
        else:
            input=sys.stdin.readline
    solve()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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)

Submission status: Accepted

Solution code:
x = int(input())

print(10-x//200)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

if ((2000-X)%200) == 0: 
    print((2000-X)//200)
else:
    print((2000-X)//200+1)

Submission status: Accepted

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy


def main():
    x = int(input())
    ans = 8
    for i in range(400, 2000, 200):
        if i <= x <= i+199:
            break
        ans -= 1

    print(ans)

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
from sys import stdin, stdout
import math,sys,heapq
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
from os import path
import bisect as bi
def yes():print('YES')
def no():print('NO')
if (path.exists('input.txt')): 
    #------------------Sublime--------------------------------------#
    sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
    def I():return (int(input()))
    def In():return(map(int,input().split()))
else:
    #------------------PYPY FAst I/o--------------------------------#
    def I():return (int(stdin.readline()))
    def In():return(map(int,stdin.readline().split()))

def dict(a):
    d={}
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d

def find_gt(a, x):
    'Find leftmost value greater than x'
    i = bi.bisect_right(a, x)
    if i != len(a):
        return i
    else:            
        return -1

def main():
    try:
        n=I()
        if n<=599:print(8)
        elif n<=799:print(7)
        elif n<=999:print(6)
        elif n<=1199:print(5)
        elif n<=1399:print(4)
        elif n<=1599:print(3)
        elif n<=1799:print(2)
        elif n<=1999:print(1)



    except:
        pass
        
M = 998244353
P = 1000000007
 
if __name__ == '__main__':
    #for _ in range(I()):main()
    for _ in range(1):main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
x=int(input())
ans=8
while x>=600:
    ans-=1
    x-=200
print(ans)

Submission status: Accepted

Solution code:
X = int(input())

def define_rate(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
    elif X >= 400:
        return 8

print(define_rate(X))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
a=400
for i in range(8,0,-1):
    if a<=x<a+200:
        print(i)
        exit()
    a+=200

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X = int(input())
up = 599
down = 400
i=8
while(i>=1):
    if(X <= up and X >= down):
        print(i)
        break
    else:
        up += 200
        down += 200
        i -= 1

Submission status: Accepted

Solution code:
import copy

# a = get_int()
def get_int():
    return int(input())

# a = get_string()
def get_string():
    return input()

# a_list = get_int_list()
def get_int_list():
    return [int(x) for x in input().split()]

# a_list = get_string_list():
def get_string_list():
    return input().split()

# a, b = get_int_multi()
def get_int_multi():  # a, b = get_int_multi()
    return map(int, input().split())

# a_list = get_string_char_list()
def get_string_char_list():
    return list(str(input()))

# print("{} {}".format(a, b))
# for num in range(0, a):
# a_list[idx]
# a_list = [0] * a
'''
while (idx < n) and ():

    idx += 1
'''

def main():

    m = get_int()
    ret = 0
    if m < 600:
        ret = 8
    elif m < 800:
        ret = 7
    elif m < 1000:
        ret = 6
    elif m < 1200:
        ret = 5
    elif m < 1400:
        ret = 4
    elif m < 1600:
        ret = 3
    elif m < 1800:
        ret = 2
    elif m < 2000:
        ret = 1

    print(ret)




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    x=I()
    t=1800
    for i in range(10):
        if x>=t:
            print(i+1)
            exit()
        t-=200

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

X = int(input())
for i, v in enumerate([1800, 1600, 1400, 1200, 1000, 800, 600, 400]):
    if X >= v:
        print(i + 1)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
for i in range(8):
    if 1800-200*i<=n<2000-100*i:
        print(i+1)
        break

Submission status: Accepted

Solution code:
X = int(input())
c = 1
for i in [1799,1599,1399,1199,999,799,599,399]:
    if X > i :
        break
    c = c + 1
print(c)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline


X = int(input())
ans = min(8, 10-X//200)
print(ans)

Submission status: Accepted

Solution code:
# Problem A - Kyu in AtCoder

# input
X = int(input())

# check
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)

Submission status: Accepted

Solution code:
x = int(input())

print(int(9 - (x-399)/200))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print((1999-int(input()))//200+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = int(input())

print(10-X//200)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
 
X=int(input())
ans=0
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)