#include<stdio.h>
#include<algorithm>
#include<vector>
#define mod 666013;

using namespace std;

int n;

vector <int> l[666013];

void adauga(int x){
int i;
i=x%mod;
l[i].push_back(x);
}
void sterge(int x){
unsigned int i;
int j=x%mod;
for(i=0;i<l[j].size();i++)
if(l[j][i]==x)
l[j][i]=-1;
}

int cauta(int x){
unsigned int i;
int j=x%mod;
for(i=0;i<l[j].size();i++)
if(l[j][i]==x)
return 1;
return 0;
}
int main(){
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
int op,x;
for(int i=1;i<=n;i++){
scanf("%d %d",&op,&x);
if(op==1)
adauga(x);
else
if(op==2)
sterge(x);
else
printf("%d\n",cauta(x));
}
fclose(stdin);
fclose(stdout);
return 0;
}