#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#define FI first
#define SE second
#define PF push_front
#define PB push_back
#define PPF pop_front
#define PPB pop_back
#define MA make_pair
#define ll long long
#define PA pair<int,int>
#define VE vector<int>
#define VP vector<PA>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
using namespace std;
//
const int INF=1e9+7;
const int mod=1e9+7;
//
//
struct poi{
  int X;int Y;int Z;
  bool operator<(const poi&R)const{
    return X==R.X ? Y==R.Y ? Z<R.Z : Y<R.Y : X<R.X;
  }
};
//
//
bool check(ll a,ll b){
	while(a!=0&&b!=0){
		if(a%2==0&&b%2==0){
			if(check(a/2,b-1)||check(b/2,a-1)){
				return true;
			}else{
				return false;
			}
		}else if(a%2==1&&b%2==1){
			return false;
		}else if(a%2==1){
			a--;
			b/=2;
		}else if(b%2==1){
			b--;
			a/=2;
		}
	}
	return true;
}
int main(){
	ll A,B;
	cin>>A>>B;
	while(A!=0&&B!=0){
		if(A%2==0&&B%2==0){
			if(check(A/2,B-1)||check(B/2,A-1)){
				Yes(1);
				return 0;
			}else{
				Yes(0);
				return 0;
			}
		}else if(A%2==1&&B%2==1){
			Yes(0);
		  return 0;
		}else if(B%2==1){
			B--;
			A/=2;
		}else{
			A--;
			B/=2;
		}
	}
	Yes(1);
	return 0;
}