from collections import deque

def solve():
    A, B = map(int, input().split())
    q = deque([(A, B)])
    visited = set()
    while q:
        a, b = q.popleft()
        if a == 0 and b == 0:
            print("Yes")
            return
        # Check for operation 1 reverse
        if a % 2 == 0 and b >= 1:
            na = a // 2
            nb = b - 1
            if (na, nb) not in visited:
                visited.add((na, nb))
                q.append((na, nb))
        # Check for operation 2 reverse
        if b % 2 == 0 and a >= 1:
            na = a - 1
            nb = b // 2
            if (na, nb) not in visited:
                visited.add((na, nb))
                q.append((na, nb))
    print("No")

solve()