#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#define M M
using namespace std;
 
 
vector<int> v[M];
int n,x,op;
 
 
int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    scanf("%d", &n);
    for(int i=0;i<n;i++)
    {
            scanf("%d %d", &op,&x);

              if(op==1) 
				  if( find( v[x%M].begin() , v[x%M].end() , x) == v[x%M].end() ) 
					  v[x%M].push_back(x);

              if(op==2) 
				  if( find( v[x%M].begin() , v[x%M].end() , x) != v[x%M].end() )
                       v[x%M].erase( find( v[x%M].begin() , v[x%M].end() , x) );

              if(op==3) 
				  if(find(v[x%M].begin(),v[x%M].end(),x)==v[x%M].end()) 
					  printf("0\n");
                  else 
					  printf("1\n");
     }

    return 0;
}