//confilm 0LL and 1LL //confilm cornercase such as 0 #include using namespace std; using ll = long long; using P = pair; using Vec = vector; using VecP = vector

; using VecB = vector; #define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i)) #define REPN(i, m, n) for(ll (i) = (m); (i) <= (n); ++(i)) #define REPR(i, m, n) for(ll (i) = (m); (i) >= (n); --(i)) #define rep(i, n) REP(i, 0, n) #define repn(i, n) REPN(i, 1, n) #define repr(i, n) REPR(i, n, 0) #define repnr(i, n) REPR(i, n, 1) #define co(n) cout << (n) << endl #define cosp(n) cout << (n) << ' ' #define setp(n) cout << fixed << setprecision(n); #define all(s) (s).begin(), (s).end() #define pb push_back #define mp make_pair #define mt make_tuple #define fs first #define sc second template bool chmax(T &a, const T& b){if(a < b){a = b; return true;} return false;} template bool chmin(T &a, const T& b){if(a > b){a = b; return true;} return false;} const ll INF = 1e9+1; const ll LINF = 1e18+1; const ll MOD = 1e9+7; //const ll MOD = 998244353; const double PI = acos(-1); const double EPS = 1e-9; int main(void){ ll a, b; cin >> a >> b; bitset<32> bitA(a), bitB(b); rep(i, 32) if(bitA[i] && !bitB[i]){ co(0); return 0; } ll n = bitB.count()-bitA.count(); co(1 << (n-1)); return 0; }