#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(0,0);
  while(!que.empty()){
    i64 x = que.front().first;
    i64 y = que.front().second;
    que.pop();
    if(x > a || y > b) continue;
    if(x == a && y == b){
      cout << "Yes" << endl;
      return 0;
    }
    que.emplace(x * 2,y + 1);
    que.emplace(x + 1,y * 2);
  }
  cout << "No" << endl;
  return 0;
}