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

 from sys import stdin, stdout import math,sys,heapq math sys heapq from itertools import permutations, combinations from collections import defaultdict,deque,OrderedDict from os import path import bisect as bi bisect def yes():print('YES') yes def no():print('NO') 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())) path.exists('input.txt') path.exists path exists 'input.txt' sys.stdin=open('input.txt','r') sys.stdin sys stdin open('input.txt','r') open 'input.txt' 'r' sys.stdout=open('output.txt','w') sys.stdout sys stdout open('output.txt','w') open 'output.txt' 'w' def I():return (int(input()))
     I def In():return(map(int,input().split In def I():return (int(stdin.readline()))
     I def In():return(map(int,stdin.readline().split In def dict(a):
    d={}
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d dict d={} d {} for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
     x a if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
     d.get(x,-1)!=-1 d.get(x,-1) d.get d get x -1 -1 d[x]+=1 d[x] d x 1 d[x]=1 d[x] d x 1 return d d a a 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 find_gt 'Find leftmost value greater than x' i = bi.bisect_right(a, x) i bi.bisect_right(a, x) bi.bisect_right bi bisect_right a x if i != len(a):
        return i
    else:            
        return -1 i != len(a) i len(a) len a return i i return -1 -1 a a x x 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
         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
         except:
        pass
         n=I() n I() 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)



     n<=599 n 599 elif n<=799:print(7)
         n<=799 n 799 elif n<=999:print(6)
         n<=999 n 999 elif n<=1199:print(5)
         n<=1199 n 1199 elif n<=1399:print(4)
         n<=1399 n 1399 elif n<=1599:print(3)
         n<=1599 n 1599 elif n<=1799:print(2)
         n<=1799 n 1799 elif n<=1999:print(1)



     n<=1999 n 1999 M = 998244353 M 998244353 P = 1000000007 P 1000000007 if __name__ == '__main__':
    #for _ in range(I()):main()
    for _ in range(1):main() __name__ == '__main__' __name__ '__main__' for _ in range(1):ma _ range(1) range 1 def I():return (int(input()))
     def I():return (int(input()))
     I def In():return(map(int,stdin.readline().split def In():return(map(int,stdin.readline().split In def I():return (int(stdin.readline()))
     def I():return (int(stdin.readline()))
     I 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
         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
         main 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 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 find_gt def yes():print('YES') def yes():print('YES') yes def no():print('NO') def no():print('NO') no def In():return(map(int,input().split def In():return(map(int,input().split In def dict(a):
    d={}
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d def dict(a):
    d={}
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d dict P = 1000000007 1000000007 P M = 998244353 998244353 M
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()


