import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;


void main() {
    long a, b;
    scan(a, b);

    bool dfs(long a, long b) {
        if (a == 0 || b == 0) {
            return true;
        }
        if ((a & 1) && (b & 1)) {
            return false;
        }
        if (a & 1) {
            return dfs(a - 1, b / 2);
        }
        if (b & 1) {
            return dfs(a / 2, b - 1);
        }
        return dfs(a - 1, b / 2) || dfs(a / 2, b - 1);
    }

    writeln(dfs(a, b) ? "Yes" : "No");
}




void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}