#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

ll flag;
map<pair<ll,ll>,ll> ma;

void f(ll a, ll b){
  if(flag==1)return;
  if(ma[mp(a,b)]==1)return;
  ma[mp(a,b)]=1;
  if(a==0||b==0)flag = 1;
  if(a%2==0&&b>0){
    f(a/2,b-1);
  }
  if(a>0&&b%2==0){
    f(a-1,b/2);
  }
}

int main() {
  flag = 0;
  ll a,b;
  cin>>a>>b;
  f(a,b);
  if(flag==1){
      cout << "Yes" << endl;
  }
  else{
      cout << "No" << endl;
  }
  return 0;
}