D = {5 ** j << i: (i, j) for i in range(10) for j in range(10)}
def step(i, j, ii, jj):
    if abs(i - ii) + abs(j - jj) == 1:
        return (ii, jj)
    if i - ii == j - jj - 1 >= 0:
        return (i, j - 1)
    if j - jj == i - ii - 1 >= 0:
        return (i - 1, j)
    if (i ^ j ^ ii ^ jj) & 1 == 0:
        if j < 9:
            return (i, j + 1)
        if i < 7:
            return (i + 1, j)
        if i > 7:
            return (i - 1, j)
        return (9, 9)
    if i == 9 and (i - ii) < (j - jj):
        return (i, j - 1)
    if j == 9 and (i - ii) > (j - jj):
        return (i - 1, j)
    if j < 9:
        return (i, j + 1)
    if i < 9:
        return (i + 1, j)

def f(n1, n2):
    i, j = D[n1]
    ii, jj = D[n2]
    a, b = step(i, j, ii, jj)
    return 5 ** b << a
    
x1, x2 = map(int, input().split())
for _ in range(35):
    x1 = f(x1, x2)
    print(x1)
    if x1 == x2:
        break
    x2 = int(input())
    if x1 == x2:
        break