'''
自宅用PCでの解答
'''
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7

def main():
    x = int(ipt())
    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)
    else:
        pass


    return None

if __name__ == '__main__':
    main() '''
自宅用PCでの解答
''' import math math import itertools itertools import queue queue import bisect bisect from collections import deque,defaultdict import heapq as hpq heapq from sys import stdin,setrecursionlimit ipt = stdin.readline ipt stdin.readline stdin readline setrecursionlimit(10**7) setrecursionlimit 10**7 10 7 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 def main():
    x = int(ipt())
    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)
    else:
        pass


    return None main x = int(ipt()) x int(ipt()) int ipt() ipt 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)
    else:
        pass


     x < 600 x 600 print(8) print 8 elif x < 800:
        print(7)
     x < 800 x 800 print(7) print 7 elif x < 1000:
        print(6)
     x < 1000 x 1000 print(6) print 6 elif x < 1200:
        print(5)
     x < 1200 x 1200 print(5) print 5 elif x < 1400:
        print(4)
     x < 1400 x 1400 print(4) print 4 elif x < 1600:
        print(3)
     x < 1600 x 1600 print(3) print 3 elif x < 1800:
        print(2)
     x < 1800 x 1800 print(2) print 2 elif x < 2000:
        print(1)
     x < 2000 x 2000 print(1) print 1 return None None if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main def main():
    x = int(ipt())
    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)
    else:
        pass


    return None def main():
    x = int(ipt())
    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)
    else:
        pass


    return None main mod = 10**9+7 10**9+7 mod ipt = stdin.readline stdin.readline ipt
'''
自宅用PCでの解答
'''
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7

def main():
    x = int(ipt())
    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)
    else:
        pass


    return None

if __name__ == '__main__':
    main()
