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 java.beans.DesignMode;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import java.util.concurrent.LinkedBlockingDeque;
import java.util.concurrent.CompletableFuture.AsynchronousCompletionTask;

import org.xml.sax.ErrorHandler;

import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.DataInputStream;

public class Solution {
        //TEMPLATE -------------------------------------------------------------------------------------
        public static boolean Local(){
            try{ 
                return System.getenv("LOCAL_SYS")!=null;
            }catch(Exception e){
                return false;
            }
        }   

        public static boolean LOCAL;

        static class FastScanner {

                BufferedReader br;
                StringTokenizer st ;

                FastScanner(){
                    br =  new BufferedReader(new InputStreamReader(System.in));
                    st = new StringTokenizer("");
                }

                FastScanner(String file) {

                    try{
                        br =  new BufferedReader(new InputStreamReader(new FileInputStream(file)));
                        st = new StringTokenizer("");
                    }catch(FileNotFoundException e) {
                        // TODO Auto-generated catch block
                        System.out.println("file not found");
                        e.printStackTrace();
                    }
                    
                }
                String next() {
                    while (!st.hasMoreTokens())
                        try {
                            st = new StringTokenizer(br.readLine());
                        } catch (IOException e) {
                        }
                    return st.nextToken();
                }

                int nextInt() {
                    return Integer.parseInt(next());
                }

                long nextLong() {
                    return Long.parseLong(next());
                }

                double nextDouble(){
                    return Double.parseDouble(next());
                }

                String readLine() throws IOException{
                    return br.readLine();
                }
            }
                                
        static class Pair<T,X> {

            T first;
            X second;
            
            Pair(T first,X second){
                this.first = first;
                this.second = second;
            }

            @Override
            public int hashCode(){
                return Objects.hash(first,second);
            }

            @Override
            public boolean equals(Object obj){
                return obj.hashCode() == this.hashCode();
            }

        }

    
    static PrintStream debug = null;      
    static long mod = (long)(Math.pow(10,9) + 7); 
//TEMPLATE -------------------------------------------------------------------------------------END//
    public static void main(String[] args) throws Exception {
        
        FastScanner s = new FastScanner();
        LOCAL = Local();
        //PrintWriter pw = new PrintWriter(System.out);
        if(LOCAL){
            s = new FastScanner("src/input.txt");
            PrintStream o = new PrintStream("src/sampleout.txt");
            debug = new PrintStream("src/debug.txt");
            System.setOut(o);
        //  pw = new PrintWriter(o);
        } long mod = 1000000007;

    
        int tcr = 1;//s.nextInt();                  
        StringBuilder sb = new StringBuilder();
    

        for(int tc=0;tc<tcr;tc++){
            long num1 = s.nextLong();
            long num2 = s.nextLong();

            if(num1 == num2){
                sb.append("YES\n");
            }else{
                long op1 = add(num1,1);
                long op2 = add(num1,0);
                long op3 = rev(op1);
                long op4 = rev(op2);

                if(op1 == num2 || op2 == num2 || op3 == num2 || op4 == num2 || check(num2,op1) || check(num2,op2) || check(num2,op3) || check(num2,op4)){
                    sb.append("YES\n");
                }else{
                    sb.append("NO\n");
                }

            }
        }

        print(sb.toString());
    }

    public static boolean check(long target,long num){
        String target_str = Long.toBinaryString(target);
        String curr_str = Long.toBinaryString(num);
        for(int i=0;i<target_str.length()-curr_str.length()+1;i++){
            if(target_str.substring(i,i+curr_str.length()).equals(curr_str)){
                if(all1(target_str,0,i-1) && all1(target_str,i+curr_str.length(),target_str.length()-1)){
                    return true;
                }
            }
        }
        return false;
    }

    public static boolean all1(String str,int st,int e){
        for(int i=st;i<=e;i++){
            if(str.charAt(i) == '0'){return false;}
        }
        return true;
    }

    public static long add(long num,long add){
        
        num = (num << 1l) + add;
        return rev(num);
    }

    public static long rev(long num){
        String str = Long.toBinaryString(num);
        long ans = 0;
        int start = 0;
        for(int i=0;i<str.length();i++){
            if(str.charAt(i) == '1'){start = i;break;}
        }
        int pow = 0;
        //println(num+" "+start+"--"+str);
        for(int i=start;i<str.length();i++){
            if(str.charAt(i) == '1'){
                ans += (1l << pow);
            }
            pow++;
        }
        return ans;
    }

    public static List<int[]> print_prime_factors(int n){
    
        List<int[]> list = new ArrayList<>();
        
        for(int i=2;i<=(int)(Math.sqrt(n));i++){

            if(n % i == 0){
                
                int cnt = 0;
                
                while( (n % i) == 0){
                    n = n/i;
                    cnt++;
                }

                list.add(new int[]{i,cnt});
            }
        }

        if(n!=1){
            list.add(new int[]{n,1});
        }

        return list;
    }

    public static List<int[]> prime_factors(int n,List<Integer> sieve){
        List<int[]> list = new ArrayList<>();
        int index = 0;
        while(n > 1 && sieve.get(index) <= Math.sqrt(n)){
            int curr = sieve.get(index);
            int cnt = 0;
            while((n % curr) == 0){
                n = n/curr;
                cnt++;
            }
            if(cnt >= 1){
                list.add(new int[]{curr,cnt});
            }
            index++;
        }
        if(n > 1){
            list.add(new int[]{n,1});
        }
        return list;
    }

    public static boolean inRange(int r1,int r2,int val){
        return ((val >= r1) && (val <= r2));
    }

    static int len(long num){
        return Long.toString(num).length();
    }

    static long mulmod(long a, long b,long mod)
    {
        long ans = 0l;
        
        while(b > 0){
            long curr = (b & 1l);
            if(curr == 1l){
                ans = ((ans % mod) + a) % mod;
            }
            
            a = (a + a) % mod;

            b = b >> 1;
        }

        return ans;
    }


    public static void dbg(PrintStream ps,Object... o) throws Exception{
        if(ps == null){
            return;
        }
        Debug.dbg(ps,o);
    }

    public static long modpow(long num,long pow,long mod){

        long val = num;
        long ans = 1l;

        while(pow > 0l){
            
            long bit = pow & 1l;

            if(bit == 1){
                ans = (ans * (val%mod))%mod;
            }

            val = (val * val) % mod;
            pow = pow >> 1;
        }

        return ans;

    }

    public static long pow(long num,long pow){

        long val = num;
        long ans = 1l;

        while(pow > 0l){
            
            long bit = pow & 1l;

            if(bit == 1){
                ans = (ans * (val));
            }

            val = (val * val);
            pow = pow >> 1;
        }

        return ans;
    }
    
    public static char get(int n){
        return (char)('a' + n);
    }

    public static long[] sort(long arr[]){
        List<Long> list = new ArrayList<>();
        for(long n : arr){list.add(n);}
        Collections.sort(list);
        for(int i=0;i<arr.length;i++){
            arr[i] = list.get(i);
        }
        return arr;
    }

    public static int[] sort(int arr[]){
        List<Integer> list = new ArrayList<>();
        for(int n : arr){list.add(n);}
        Collections.sort(list);
        for(int i=0;i<arr.length;i++){
            arr[i] = list.get(i);
        }
        return arr;
    }

    // return the (index + 1)
    // where index is the pos of just smaller element
    // i.e count of elemets strictly less than num
    public static int justSmaller(long arr[],long num){
        //  System.out.println(num+"@");
        int st = 0;
        int e = arr.length - 1;

        int ans = -1;

        while(st <= e){

            int mid = (st + e)/2;

            if(arr[mid] >= num){
                e = mid - 1;
            }else{
                ans = mid;
                st = mid + 1;
            }

        }


        return ans + 1;

    }
    public static int justSmaller(int arr[],int num){
        //  System.out.println(num+"@");
        int st = 0;
        int e = arr.length - 1;

        int ans = -1;

        while(st <= e){

            int mid = (st + e)/2;

            if(arr[mid] >= num){
                e = mid - 1;
            }else{
                ans = mid;
                st = mid + 1;
            }

        }


        return ans + 1;

    }
    
    //return (index of just greater element)
    //count of elements smaller than or equal to num

    public static int justGreater(long arr[],long num){
        int st = 0;
        int e = arr.length - 1;

        int ans = arr.length;

        while(st <= e){
            
            int mid = (st + e)/2;

            if(arr[mid] <= num){
                st = mid + 1;
            }else{
                ans = mid;
                e = mid - 1;
            }
        }

        return ans;

    }

    public static int justGreater(int arr[],int num){
        int st = 0;
        int e = arr.length - 1;

        int ans = arr.length;

        while(st <= e){
            
            int mid = (st + e)/2;

            if(arr[mid] <= num){
                st = mid + 1;
            }else{
                ans = mid;
                e = mid - 1;
            }
        }

        return ans;

    }

    

    public static void println(Object obj){
        System.out.println(obj.toString());
    }

    public static void print(Object obj){
        System.out.print(obj.toString());
    }

    public static int gcd(int a,int b){
        if(b == 0){return a;}
        return gcd(b,a%b);
    }

    public static long gcd(long a,long b){
        if(b == 0l){
            return a;
        }

        return gcd(b,a%b);
    }

    public static int find(int parent[],int v){
        if(parent[v] == v){
            return v;
        }
        
        return parent[v] = find(parent, parent[v]);
    }



    public static List<Integer> sieve(){
    
            List<Integer> prime = new ArrayList<>();

            int arr[] = new int[1000001];

        Arrays.fill(arr,1);

        arr[1] = 0;
        arr[2] = 1;

        for(int i=2;i<1000001;i++){
            
            if(arr[i] == 1){
                
                prime.add(i);

                for(long j = (i*1l*i);j<1000001;j+=i){
                    arr[(int)j] = 0;
                }
            }
        }

        return prime;
    }

    static boolean isPower(long n,long a){
        
        long log = (long)(Math.log(n)/Math.log(a));

        long power = (long)Math.pow(a,log);

        if(power == n){return true;}

        return false;
    }


    private static int mergeAndCount(int[] arr, int l,int m, int r)
    {
        // Left subarray
        int[] left =  Arrays.copyOfRange(arr, l, m + 1);

        // Right subarray
        int[] right = Arrays.copyOfRange(arr, m + 1, r + 1);

        int i = 0, j = 0, k = l, swaps = 0;

        while (i < left.length && j < right.length) {
            if (left[i] <= right[j])
                arr[k++] = left[i++];
            else {
                arr[k++] = right[j++];
                swaps += (m + 1) - (l + i);
            }
        }
        while (i < left.length)
            arr[k++] = left[i++];
        while (j < right.length)
            arr[k++] = right[j++];
        return swaps;
    }

    // Merge sort function
    private static int mergeSortAndCount(int[] arr, int l,int r)
    {

        // Keeps track of the inversion count at a
        // particular node of the recursion tree
        int count = 0;

        if (l < r) {
            int m = (l + r) / 2;

            // Total inversion count = left subarray count
            // + right subarray count + merge count

            // Left subarray count
            count += mergeSortAndCount(arr, l, m);

            // Right subarray count
            count += mergeSortAndCount(arr, m + 1, r);

            // Merge count
            count += mergeAndCount(arr, l, m, r);
        }

        return count;
    }

    static class Debug{
        //change to System.getProperty("ONLINE_JUDGE")==null; for CodeForces
        public static final boolean LOCAL = System.getProperty("ONLINE_JUDGE")==null;

        

        private static <T> String ts(T t) {
            if(t==null) {
                return "null";
            }
            try {
                return ts((Iterable<T>) t);
            }catch(ClassCastException e) {
                if(t instanceof int[]) {
                    String s = Arrays.toString((int[]) t);
                    return "{"+s.substring(1, s.length()-1)+"}\n";
                }else if(t instanceof long[]) {
                    String s = Arrays.toString((long[]) t);
                    return "{"+s.substring(1, s.length()-1)+"}\n";
                }else if(t instanceof char[]) {
                    String s = Arrays.toString((char[]) t);
                    return "{"+s.substring(1, s.length()-1)+"}\n";
                }else if(t instanceof double[]) {
                    String s = Arrays.toString((double[]) t);
                    return "{"+s.substring(1, s.length()-1)+"}\n";
                }else if(t instanceof boolean[]) {
                    String s = Arrays.toString((boolean[]) t);
                    return "{"+s.substring(1, s.length()-1)+"}\n";
                }
                try {
                    return ts((Object[]) t);
                }catch(ClassCastException e1) {
                    return t.toString();
                }
            }
        }
        private static <T> String ts(T[] arr) {
            StringBuilder ret = new StringBuilder();
            ret.append("{");
            boolean first = true;
            for(T t: arr) {
                if(!first) {
                    ret.append(", ");
                }
                first = false;
                ret.append(ts(t));
            }
            ret.append("}");
            return ret.toString();
        }
        private static <T> String ts(Iterable<T> iter) {
            StringBuilder ret = new StringBuilder();
            ret.append("{");
            boolean first = true;
            for(T t: iter) {
                if(!first) {
                    ret.append(", ");
                }
                first = false;
                ret.append(ts(t));
            }
            ret.append("}\n");
            return ret.toString();
        }
        public static void dbg(PrintStream ps,Object... o) throws Exception {
            if(LOCAL) {
                System.setErr(ps);
                System.err.print("Line #"+Thread.currentThread().getStackTrace()[2].getLineNumber()+": [\n");
                for(int i = 0; i<o.length; i++) {
                    if(i!=0) {
                        System.err.print(", ");
                    }
                    System.err.print(ts(o[i]));
                }
                System.err.println("]");
            }
        }
    }

}