import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

X = ii()

tmp = X // 100
step = 0

for i in range(4, 20, 2):
    if i <= tmp < i+2:
        print(8-step)
        exit()
    step += 1 import sys sys sys.setrecursionlimit(10**8) sys.setrecursionlimit sys setrecursionlimit 10**8 10 8 def ii(): return int(sys.stdin.readline()) ii def mi(): return map(int, sys.stdin.readline().split()) mi def li(): return list(map(int, sys.stdin.readline().split())) li list(map(int, sys.stdin.readline().split())) for i in range(N) for i in range(N) i range(N) range N for i in range(N) list(map(int, sys.stdin.readline().split())) list map(int, sys.stdin.readline().split()) map int sys.stdin.readline().split() sys.stdin.readline().split sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline split def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)] li2 N N [ini]*i for i2 in range(j) for i2 in range(j) i2 range(j) range j for i2 in range(j) [ini]*i [ini] ini i def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A)) dp2 ini ini i i j j X = ii() X ii() ii tmp = X // 100 tmp X // 100 X 100 step = 0 step 0 for i in range(4, 20, 2):
    if i <= tmp < i+2:
        print(8-step)
        exit()
    step += 1 i range(4, 20, 2) range 4 20 2 if i <= tmp < i+2:
        print(8-step)
        exit()
     i <= tmp < i+2 i <= tmp i tmp i+2 i 2 print(8-step) print 8-step 8 step exit() exit step += 1 step 1 X = ii() ii() X step = 0 0 step tmp = X // 100 X // 100 tmp def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)] def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)] li2 def ii(): return int(sys.stdin.readline()) def ii(): return int(sys.stdin.readline()) ii def li(): return list(map(int, sys.stdin.readline().split())) def li(): return list(map(int, sys.stdin.readline().split())) li def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A)) def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A)) dp2 step += 1 1 step def mi(): return map(int, sys.stdin.readline().split()) def mi(): return map(int, sys.stdin.readline().split()) mi
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

X = ii()

tmp = X // 100
step = 0

for i in range(4, 20, 2):
    if i <= tmp < i+2:
        print(8-step)
        exit()
    step += 1