def can_reach(A, B):
    from collections import deque

    visited = set()
    queue = deque()
    queue.append((A, B))
    visited.add((A, B))

    while queue:
        x, y = queue.popleft()

        if x == 0 and y == 0:
            return True
        if x == 0:
            return True
        if y == 0:
            return True

        # Check if both are odd
        if x % 2 == 1 and y % 2 == 1:
            continue

        # Try reverse of operation1: X = X //2, Y = Y-1
        if x % 2 == 0 and y >= 1:
            new_x = x // 2
            new_y = y - 1
            if (new_x, new_y) not in visited:
                visited.add((new_x, new_y))
                queue.append((new_x, new_y))

        # Try reverse of operation2: X = X-1, Y = Y //2
        if y % 2 == 0 and x >= 1:
            new_x = x - 1
            new_y = y // 2
            if (new_x, new_y) not in visited:
                visited.add((new_x, new_y))
                queue.append((new_x, new_y))

    return False

A, B = map(int, input().split())
if can_reach(A, B):
    print("Yes")
else:
    print("No")