#include using namespace std; using ll = long long; template using vt = vector; template using vvt = vector>; template using ttt = tuple; using tii = tuple; using vi = vector; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define pb push_back #define mt make_tuple #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second #define DEB cerr<<"!"<0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;} inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;} /*Coding Space*/ bool check(ll a, ll b){ //SHOW(a,b); if(a == 0 || b == 0) return true; if(a&1 && b&1){ return false; }else if(a&1){ ll ma = max(a-1, b >> 1); ll mi = min(a-1, b >> 1); return check(mi, ma); }else if(b&1){ ll ma = max(b-1, a >> 1); ll mi = min(b-1, a >> 1); return check(mi, ma); }else{ return (check(a >> 1,b-1) || check(a-1,b >> 1)); } } int main(){ ll a,b; cin >> a >> b; if(a > b)swap(a,b); if(check(a,b)){ cout << "Yes" << endl; }else{ cout << "No" << endl; } }