#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int BLOCK = 5000;

int N, Q;
vector<char> O;
vector<unsigned> I;

vector<unsigned long long> as, bs;

void build(int e, int p0) {
  if (e == 0) {
    auto &b = bs[p0];
    b ^= (b & 0x00000000ffffffffULL) << 32;
    b ^= (b & 0x0000ffff0000ffffULL) << 16;
    b ^= (b & 0x00ff00ff00ff00ffULL) << 8;
    b ^= (b & 0x0f0f0f0f0f0f0f0fULL) << 4;
    b ^= (b & 0x3333333333333333ULL) << 2;
    b ^= (b & 0x5555555555555555ULL) << 1;
  } else {
    --e;
    const int p1 = p0 | 1 << e;
    for (int p = p0; p < p1; ++p) bs[p | 1 << e] ^= bs[p];
    build(e, p0);
    build(e, p0 | 1 << e);
  }
}

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    O.resize(Q);
    I.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf(" %c%u", &O[q], &I[q]);
    }
    
    as.assign(1 << (N-6), 0ULL);
    bs.assign(1 << (N-6), 0ULL);
    
    for (int qL = 0, qR; qL < Q; qL = qR) {
      qR = min(qL + BLOCK, Q);
      copy(as.begin(), as.end(), bs.begin());
      build(N-6, 0);
      for (int q = qL; q < qR; ++q) {
        if (O[q] == '!') {
          as[I[q] >> 6] ^= 1ULL << (I[q] & 63);
        } else {
          int ans = bs[I[q] >> 6] >> (I[q] & 63) & 1;
          for (int qq = qL; qq < q; ++qq) if (O[qq] == '!') {
            if (!(I[qq] & ~I[q])) {
              ans ^= 1;
            }
          }
          printf("%d\n", ans);
        }
      }
    }
  }
  return 0;
}