#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
//#define N (1000000000+7)
//#define N (998244353)
#define N 17
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;

const int inf = 1e9;

bool dfs(ll A,ll B){
    if(A>B)swap(A,B);
    if(A==0 && B==0)return true;
    if(A==0)return true;
    if(A<0 || B<0)return false;
    if(A%2==1 && B%2==1){
        return false;
    }
    if(A%2==0 && B%2==1){
        return dfs(A/2,B-1);
    }
    if(A%2==1 && B%2==0){
        return dfs(A-1,B/2);
    }
    if(A%2==0 && B%2==0){
        return dfs(A/2,B-1)|dfs(A-1,B/2);
    }
}

int main(void){
    ll A,B;
    cin>>A>>B;
    if(dfs(A,B))cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}