from heapq import heappush, heappop, heapify
import sys
from collections import defaultdict, deque
from math import ceil, floor, sqrt, factorial, gcd
from itertools import permutations, combinations
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**6)
# input = sys.stdin.readline


a, b = map(int, input().split())
A = bin(a)[2:]
B = bin(b)[2:]
# print(A, B)
A = A[::-1]
B = B[::-1]
l = len(B)
for i in range(len(A)):
    if A[i] == "1":
        if i >= l or B[i] != "1":
            print("No")
            exit()

print("Yes")