#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){
  if(x == 0 || y == 0) return true;
  if(x % 2 == 0 && dfs(x / 2,y - 1)) return true;
  if(y % 2 == 0 && dfs(x - 1,y / 2)) return true;
  return false;
}
int main(){
  cin >> a >> b;
  queue<pair<i64,i64>> que;
  if(dfs(a,b)){
    cout << "Yes" << endl;
    return 0;
  }
  cout << "No" << endl;
  return 0;
}