#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=N*120+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,q;
ull f[4][256][15700];
void Solve(){
	scanf("%d%d",&n,&q);
	int m=0;
	while(q--){
		char c=Gc();while(c^'!'&&c^'?') c=Gc();
		ui x;scanf("%u",&x);
		if(c=='!'){
			for(int i=0;i<4;i++){
				for(int j=0;j<256;j++) if((x&j)==(x&255)) f[i][j][m>>6]^=1ull<<(m&63);
				x>>=8;
			}
			m++;
		}else{
			ull ans=0;
			for(int i=0;i<=(m>>6);i++){
				ans^=f[0][x&255][i]&f[1][x>>8&255][i]&f[2][x>>16&255][i]&f[3][x>>24][i];
			}
			printf("%d\n",__builtin_parityll(ans));
		}
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}