import math

A, B = map(int, input().split())

n = 1
while True:
    # Calculate A's a range
    a_min_A = math.ceil(( (2*A - 1) * n ) / 200.0 )
    a_max_A = math.floor( ( (2*A + 1) * n ) / 200.0 - 1e-9 )
    
    # Calculate B's a range
    num_b_min = (2*(100 - B) - 1) * n
    b_min = math.floor(num_b_min / 200.0) + 1
    num_b_max = (2*(100 - B) + 1) * n
    b_max = math.floor(num_b_max / 200.0)
    
    # Find overlapping range
    lower = max(a_min_A, b_min)
    upper = min(a_max_A, b_max)
    
    if lower > upper:
        n += 1
        continue
    
    # Adjust to a valid range (0 <= a <= n)
    if lower < 0:
        lower = 0
    if upper > n:
        upper = n
    if lower > upper:
        n += 1
        continue
    
    # Check if there's any integer in [lower, upper]
    if lower <= upper:
        print(n)
        break
    
    n += 1