#include <bits/stdc++.h>   using namespace std;   int cl[5000010], cr[5000010], ld[5000010], sl = 1;   bool yz[5000010];   void pushd(int x) {     if (cl[x] == 0) {       cl[x] = ++sl;       yz[cl[x]] = 1;     }     if (cr[x] == 0) {       cr[x] = ++sl;       yz[cr[x]] = 1;     }     yz[x] = 0;     if (ld[x] == 0) return;     ld[cl[x]] = ld[cr[x]] = ld[x];     ld[x] = 0;   }   vector<int> cf[50010], ve[5000010];   void addqj(int i, long long l, long long r, long long L, long long R, int x) {     if (R <= l || r <= L) return;     if (L <= l && r <= R) {       ld[i] = x;       cf[x].push_back(i);       return;     }     long long m = (l + r) >> 1;     pushd(i);     addqj(cl[i], l, m, L, R, x);     addqj(cr[i], m, r, L, R, x);   }   void link(int x, int y) {     if (yz[x] && yz[y]) {       if (ld[x] < ld[y])         ve[x].push_back(y);       else         ve[y].push_back(x);       return;     }     link(yz[x] ? x : cl[x], yz[y] ? y : cl[y]);     link(yz[x] ? x : cr[x], yz[y] ? y : cr[y]);   }   int find(int i, long long l, long long r, long long x) {     if (yz[i]) return i;     long long m = (l + r) >> 1;     return x < m ? find(cl[i], l, m, x) : find(cr[i], m, r, x);   }   int lx[50010], fa[5000010], ans[50010];   long long A[50010], B[50010];   int getv(int x) { return x == fa[x] ? x : fa[x] = getv(fa[x]); }   void merge(int x, int y) {     x = getv(x);     y = getv(y);     if (x != y) fa[x] = y;   }   int main() {     int n, m;     scanf( %d%d , &n, &m);     ld[1] = m + 1;     yz[1] = 1;     for (int i = 1; i <= m; i++) {       char zf[10];       scanf( %s%lld%lld , zf, &A[i], &B[i]);       lx[i] = zf[0] ==  b  ? 0 : 1;       if (lx[i] == 0) addqj(1, 0, (1ll << n), A[i], B[i] + 1, i);     }     for (int i = 1; i <= sl; i++) {       fa[i] = i;       if (!yz[i]) link(cl[i], cr[i]);     }     for (int i = 1; i <= sl; i++) {       if (ld[i] != m + 1) continue;       for (int j = 0; j < ve[i].size(); j++) merge(i, ve[i][j]);     }     for (int i = m; i >= 1; i--) {       if (lx[i])         ans[i] = (getv(find(1, 0, (1ll << n), A[i])) ==                   getv(find(1, 0, (1ll << n), B[i])));       else {         for (int x = 0; x < cf[i].size(); x++) {           int u = cf[i][x];           for (int y = 0; y < ve[u].size(); y++) merge(u, ve[u][y]);         }       }     }     for (int i = 1; i <= m; i++) {       if (lx[i]) printf( %d n , ans[i]);     }     return 0;   }   