#include <iostream>
#include <queue>
#include <string>
#include <algorithm>
using namespace std;
typedef long long int ll;
bool dfs(ll a,ll b){
    if(a==0&&b==0) return true;
    else if(a<0||b<0) return false;
    else if((a%2==0&&b>0)&&(b%2==0&&a>0)) return dfs(a/2,b-1)||dfs(a-1,b/2);
    else if(a%2==0&&b>0) return dfs(a/2,b-1);
    else if(b%2==0&&a>0) return dfs(a-1,b/2);
    return false;
}

int main(){
    ll a, b;
    cin >> a >> b;
    if(a<b) swap(a,b);

    if(dfs(a,b)) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}