#!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() from collections import defaultdict, deque, Counter from heapq import heappush, heappop from itertools import permutations import sys sys import math math import bisect bisect int(x) for x in sys.stdin.readline().split() for x in sys.stdin.readline().split() x sys.stdin.readline().split() sys.stdin.readline().split sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline split for x in sys.stdin.readline().split() int(x) int x def LI(): return [int(x) for x in sys.stdin.readline().split()] LI def I(): return int(sys.stdin.readline()) I list(x) for x in sys.stdin.readline().split() for x in sys.stdin.readline().split() x sys.stdin.readline().split() sys.stdin.readline().split sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline split for x in sys.stdin.readline().split() list(x) list x def LS(): return [list(x) for x in sys.stdin.readline().split()] LS def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res S res = list(sys.stdin.readline()) res list(sys.stdin.readline()) list sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline if res[-1] == "\n":
        return res[:-1]
     res[-1] == "\n" res[-1] res -1 "\n" return res[:-1] res[:-1] res :-1 -1 return res res def IR(n):
    return [I() for i in range(n)] IR I() for i in range(n) for i in range(n) i range(n) range n for i in range(n) I() I return [I() for i in range(n)] [I() for i in range(n)] n n def LIR(n):
    return [LI() for i in range(n)] LIR LI() for i in range(n) for i in range(n) i range(n) range n for i in range(n) LI() LI return [LI() for i in range(n)] [LI() for i in range(n)] n n def SR(n):
    return [S() for i in range(n)] SR S() for i in range(n) for i in range(n) i range(n) range n for i in range(n) S() S return [S() for i in range(n)] [S() for i in range(n)] n n def LSR(n):
    return [LS() for i in range(n)] LSR LS() for i in range(n) for i in range(n) i range(n) range n for i in range(n) LS() LS return [LS() for i in range(n)] [LS() for i in range(n)] n n sys.setrecursionlimit(1000000) sys.setrecursionlimit sys setrecursionlimit 1000000 mod = 1000000007 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 solve x = I() x I() 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)
     599 >= x >= 400 599 >= x 599 x 400 print(8) print 8 elif 799 >= x >= 600:
        print(7)
     799 >= x >= 600 799 >= x 799 x 600 print(7) print 7 elif 999 >= x >= 800:
        print(6)
     999 >= x >= 800 999 >= x 999 x 800 print(6) print 6 elif 1199 >= x >= 1000:
        print(5)
     1199 >= x >= 1000 1199 >= x 1199 x 1000 print(5) print 5 elif 1399 >= x >= 1200:
        print(4)
     1399 >= x >= 1200 1399 >= x 1399 x 1200 print(4) print 4 elif 1599 >= x >= 1400:
        print(3)
     1599 >= x >= 1400 1599 >= x 1599 x 1400 print(3) print 3 elif 1799 >= x >= 1600:
        print(2)
     1799 >= x >= 1600 1799 >= x 1799 x 1600 print(2) print 2 elif 1999 >= x >= 1800:
        print(1)
     1999 >= x >= 1800 1999 >= x 1999 x 1800 print(1) print 1 return if __name__ == "__main__":
    solve() __name__ == "__main__" __name__ "__main__" solve() solve def LSR(n):
    return [LS() for i in range(n)] def LSR(n):
    return [LS() for i in range(n)] LSR def IR(n):
    return [I() for i in range(n)] def IR(n):
    return [I() for i in range(n)] IR 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 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 solve def LI(): return [int(x) for x in sys.stdin.readline().split()] def LI(): return [int(x) for x in sys.stdin.readline().split()] LI def LS(): return [list(x) for x in sys.stdin.readline().split()] def LS(): return [list(x) for x in sys.stdin.readline().split()] LS def LIR(n):
    return [LI() for i in range(n)] def LIR(n):
    return [LI() for i in range(n)] LIR def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res S def SR(n):
    return [S() for i in range(n)] def SR(n):
    return [S() for i in range(n)] SR mod = 1000000007 1000000007 mod def I(): return int(sys.stdin.readline()) def I(): return int(sys.stdin.readline()) I
#!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()
