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

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


bool calc(long x, long y) {
  if (x == 0 && y == 0) {
    return true;
  }
  if (x % 2 == 0 && y >= 1 && calc(x / 2, y - 1)) {
    return true;
  }
  if (x >= 1 && y % 2 == 0 && calc(x - 1, y / 2)) {
    return true;
  }
  return false;
}

void main() {
  /*
  debug {
    enum lim = 20;
    auto dp = new bool[][](lim, lim);
    dp[0][0] = true;
    foreach (x; 0 .. lim) foreach (y; 0 .. lim) {
      if (dp[x][y]) {
        if (x * 2 < lim && y + 1 < lim) {
          dp[x * 2][y + 1] = true;
        }
        if (x + 1 < lim && y * 2 < lim) {
          dp[x + 1][y * 2] = true;
        }
      }
    }
    foreach (x; 0 .. lim) {
      writeln(dp[x].map!(b => (b ? '#' : '.')).to!string);
    }
  }
  */
  
  try {
    for (; ; ) {
      const A = readLong();
      const B = readLong();
      const ans = calc(A, B);
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}