#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
i64 a,b;

bool dfs(i64 x,i64 y){
}
int main(){
  cin >> a >> b;
  queue<pair<i64,i64>> que;
  que.emplace(a,b);
  while(!que.empty()){
    i64 x = que.front().first;
    i64 y = que.front().second;
    que.pop();
    if(x == 0 && y == 0){
      cout << "Yes" << endl;
      return 0;
    }
    if(x % 2 == 0 && y > 0) que.emplace(x / 2,y - 1);
    if(y % 2 == 0 && x > 0) que.emplace(x - 1,y / 2);
  }
  cout << "No" << endl;
  return 0;
}