#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll mod = 1e9+7;
//LLONG_MIN

//WA

int main(void){
	ll a,b;
	bool can=false;
	cin>>a>>b;
	queue<mp> Q;
	Q.push(make_pair(a,b));
	while(!Q.empty()){
		mp p = Q.front();Q.pop();
		ll x=p.first,y=p.second;
		if(x==0 && y==0){
			can=true;
			break;
		}
		if(x%2==0 && y>0)Q.push(make_pair(x/2,y-1));
		if(y%2==0 && x>0)Q.push(make_pair(x-1,y/2));
	}
	if(can){
		printf("Yes\n");
	}else{
		printf("No\n");
	}
}