#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }
template<class T, class V> istream& operator>> (istream& ist, pair<T, V>& p) { return ist >> p.first >> p.second; }
template<class T> ostream& operator<< (ostream& ost, pair<T, T>& p) { return ost << p.first << ", " << p.second; }
template<class T> istream& operator>> (istream& ist, vector<T>& vs) { for(auto& e: vs) ist >> e; return ist; }

typedef long long ll;
int const inf = INT_MAX / 2;

map<pair<ll, ll>, bool> memo;

bool solve(ll x, ll y) {
  if (memo.find({x, y}) != memo.end()) { return memo[{x, y}]; }
  if (x == 0 && y == 0) { return true; }
  if (x < 0 || y < 0) { return false; }
  bool ret = 0;
  if (x % 2 == 0) { ret = solve(x / 2, y - 1); }
  if (y % 2 == 0) { ret = ret || solve(x - 1, y / 2); }
  return memo[{x, y}] = ret;
}

int main() {
  ll A, B; cin >> A >> B;
  cout << (solve(A, B) ? "Yes\n" : "No\n");
}