#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

ll a, b;
bool dfs(ll x, ll y, map<pair<ll,ll>, bool> mp) {
	if (mp.find(make_pair(x, y)) != mp.end()) mp[make_pair(x, y)];
	if (x == a && y == b) return true;
	ll nx1 = x * 2;
	ll ny1 = y + 1;
	bool flag = false;
	if (nx1 <= a && ny1 <= b) flag |= dfs(nx1, ny1, mp);
	ll nx2 = x + 1;
	ll ny2 = y * 2;
	if (nx2 <= a && ny2 <= b) flag |= dfs(nx2, ny2, mp);
	return mp[make_pair(x, y)] = flag;
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	cin >> a >> b;
	if (a * b == 0) puts("Yes");
	else {
		bool flag = false;
		map<pair<ll, ll>, bool> mp;
		if (a < b) swap(a, b);
		flag |= dfs(1, 0, mp);
		if (flag) puts("Yes");
		else puts("No");
	}
	return 0;
}