#include <iostream>
#include <map>

using lint = long long;

bool dfs(lint a, lint b) {
    static std::map<std::pair<lint, lint>, bool> dp;
    auto p = std::make_pair(a, b);
    if (dp.count(p)) return dp[p];
    auto& ret = dp[p];

    if (a == 0 && b == 0) return ret = true;
    if (a % 2 == 0 && b > 0 && dfs(a / 2, b - 1)) return ret = true;
    if (a > 0 && b % 2 == 0 && dfs(a - 1, b / 2)) return ret = true;
    return ret = false;
}

void solve() {
    lint a, b;
    std::cin >> a >> b;
    std::cout << (dfs(a, b) ? "Yes" : "No") << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}