#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf = 1e9+7;

ll A,B;
string ans;
int main() {
    cin>>A>>B;
    ans="Yes";
    while(!(A==0&&B==0)){
        if(A%2&&B%2){
            ans="No";
            break;
        }else if(A%2){
            B/=2;
            A--;
        }else if(B%2){
            A/=2;
            B--;
        }else if(A>=B){
            A/=2;
            B--;
        }else if(B>A){
            B/=2;
            A--;
        }
    }
    if(A>0||B>0){
        ans="No";
    }
    p(ans);
    return 0;
}