#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
//#define INF 1<<31-1
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
typedef long long int ll;
//typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};
int INF=INT_MAX;

using namespace std;

bool dfs(ll a,ll b){
    if(a==0&&b==1 || a==1&&b==0)return true;
    if(a%2==0&&b%2==1)if(dfs(a/2,b-1))return true;
    if(a%2==1&&b%2==1)if(dfs(a-1,b/2))return true;
    if(a%2==0&&b%2==0)if(dfs(a-1,b/2)||dfs(a/2,b-1))return true;
    return false;
}

int main(){
    ll a,b;
    cin>>a>>b;
    if(a==0&&b==0){
        cout<<"Yes"<<endl;
        return 0;
    }
    if(dfs(a,b))cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    
    return 0;
}