You are given two positive integers x and y. You can perform the following operation with x: write it in its binary form without leading zeros, add 0 or 1 to the right of it, reverse the binary form and turn it into a decimal number which is assigned as the new value of x.

For example: 

  * 34 can be turned into 81 via one operation: the binary form of 34 is 100010, if you add 1, reverse it and remove leading zeros, you will get 1010001, which is the binary form of 81. 
  * 34 can be turned into 17 via one operation: the binary form of 34 is 100010, if you add 0, reverse it and remove leading zeros, you will get 10001, which is the binary form of 17. 
  * 81 can be turned into 69 via one operation: the binary form of 81 is 1010001, if you add 0, reverse it and remove leading zeros, you will get 1000101, which is the binary form of 69. 
  * 34 can be turned into 69 via two operations: first you turn 34 into 81 and then 81 into 69. 



Your task is to find out whether x can be turned into y after a certain number of operations (possibly zero).

Input

The only line of the input contains two integers x and y (1 ≤ x, y ≤ 10^{18}).

Output

Print YES if you can make x equal to y and NO if you can't.

Examples

Input


3 3


Output


YES


Input


7 4


Output


NO


Input


2 8


Output


NO


Input


34 69


Output


YES


Input


8935891487501725 71487131900013807


Output


YES

Note

In the first example, you don't even need to do anything.

The fourth example is described in the statement.
470060730774588924 727173667167621133
 23654897456254158 36584562123658749
 100 100
 1048576 1048576
 3165137368662540 34690334760256012
 2963671906804332 23709375254434663
 2 2
 469234491891472796 290944711594072288
 10 5
 662695912942035259 813128064161
 10 576460752303423487
 9762130370617853 135862919936991741
 407 113
 88888888888888888 99999999999999999
 20 607
 968503512949840 70798422886785671
 4997 4748
 20 20
 11 27
 2651 1994
 114514 114514
 642061520256 807582787377560508
 100 403
 95 427
 4 4
 98376470102098 8668311108715159
 2 6
 8935891487501725 71986286270688669
 6 1
 90 180
 5 55
 8 1
 11 13
 4529535624500812 36236284996006503
 1717 879
 54043195528445952 3
 32 457
 12312 12312
 1579442997370991 12635543978967935
 41 119
 272137586985970 17939699391684503
 8 8
 32 32
 2651 21215
 592255623895602343 956231061252005500
 22 107
 1 576460752303423487
 1 67108863
 470886973952672348 163402627036137273
 3991380546745964 35516577938339436
 435 1515
 4997 39983
 18014398509481984 54043195528445952
 6261 668
 45454 45454
 1 1125899906842623
 3145302420099927 25162419360799423
 26 47
 25 19
 999999999999999999 864691128455135231
 10 10
 1 2147483647
 4 5
 44 44
 22 11
 985 1653
 794746691033263 69408368311453055
 100 201
 10 11
 13 11
 753 271
 16 16
 2 1
 942220828365 412458936303
 407 3263
 5 10
 34 17
 44 29
 42 2193386110975
 753 6031

NO
 NO
 YES
 YES
 NO
 YES
 YES
 NO
 YES
 NO
 NO
 YES
 NO
 NO
 YES
 YES
 NO
 YES
 YES
 NO
 YES
 NO
 YES
 NO
 YES
 YES
 NO
 YES
 NO
 NO
 YES
 YES
 YES
 YES
 NO
 YES
 NO
 YES
 YES
 NO
 YES
 YES
 YES
 YES
 NO
 NO
 YES
 YES
 NO
 NO
 NO
 YES
 NO
 NO
 YES
 YES
 YES
 YES
 YES
 NO
 YES
 YES
 NO
 YES
 YES
 NO
 YES
 YES
 YES
 YES
 NO
 YES
 YES
 NO
 YES
 NO
 YES
 YES
 YES
 YES

import itertools
import functools


def op0(x):
    return int(bin(x)[2:][::-1], 2)


def op1(x):
    return int('1' + bin(x)[2:][::-1], 2)


def solve(x, y, x_nums):
    if x == y:
        return True
    if x > 1e20:
        return False
    if x in x_nums:
        return False
    x_nums.add(x)
    return solve(op0(x), y, x_nums) or solve(op1(x), y, x_nums)


def main():
    x, y = map(int, input().split())
    if solve(x, y, set()):
        print('YES')
    else:
        print('NO')


if __name__ == '__main__':
    main()
