#include<iostream> #include<vector> #include<algorithm> #include<cctype> #include<utility> #include<string> #include<cstring> #include<cmath> #include<numeric> #include<queue> #include<climits> #include<cstdio> #define REP(i, n) for(int i = 0;i < n;i++) #define REPR(i, n) for(int i = n;i >= 0;i--) #define FOR(i, m, n) for(int i = m;i < n;i++) #define FORR(i, m, n) for(int i = m;i >= n;i--) #define SORT(v, n) sort(v, v+n); #define VSORT(v) sort(v.begin(), v.end()); #define llong long long #define pb(a) push_back(a) //#define INF ((LLONG_MAX) / (2)) using namespace std; typedef pair<int, int> P; typedef pair<llong, llong> LP; typedef pair<int, P> PP; typedef pair<llong, LP> LPP; typedef long long int ll; typedef pair<ll,int> LL_IP; typedef pair<ll,ll> LL_LLP; #define INF 1e9+7 bool dfs(ll a,ll b){ if(a == 0 || b == 0){ return true; } bool flag = false; if(a % 2 == 0){ //操作1の逆 flag |= dfs(a/2,b-1); } if(b % 2 == 0){ //操作2の逆 flag |= dfs(a-1,b/2); } //奇数、奇数の場合は再帰に入らずfalseが返る return flag; } int main(){ ll a,b; cin >> a >> b; bool ans = dfs(a,b); if(ans){ cout << "Yes" << endl; }else{ cout << "No" << endl; } return 0; }