import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

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 SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    A,B=MI()
    ans=10**9
    for a in range(1000):
        for b in range(1000):
            if (A-0.5)*(a+b)<=100*a<(A+0.5)*(a+b) and (B-0.5)*(a+b)<=100*b<(B+0.5)*(a+b):
                ans=min(ans,a+b)
    print(ans)

main()