#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf = 1e9+7;

string ans;
bool dfs(ll A,ll B){
    if(A==0||B==0){
       return true;
    }
    if(A%2&&B%2){
        return false;
    }else if(A%2){
        return dfs(A-1,B/2);
    }else if(B%2) {
        return dfs(A/2,B-1);
    }else{
        return dfs(A-1,B/2)||dfs(A/2,B-1);
    }


}
ll A,B;

int main() {
    cin>>A>>B;
    if(dfs(A,B)){
        ans="Yes";
    }else{
        ans="No";
    }

    p(ans);
    return 0;
}