#include<cstdio>
#include<cstdlib>
#define mod 666013
int n;
vector<int> v[mod];
int find(int x)
{
    ind=x%mod;
    for(int i=0;i<v[ind].size();i++)
    if(v[ind][i]==x) return 1;
    return 0;
}
void insert(int x)
{
    if(find(x)==0)
    v[x%mod].push_back(x);
}
void remove(int x)
{
    ind=x%mod;
    for(int i=0;i<v[ind].size();i++)
    if(v[ind][i]==x)
    {
        aux=v[ind][i];
        v[ind][i]=v[ind][v[ind].size()-1];
        v[ind][v[ind].size()-1]=aux;
        v[ind].pop_back();
    }
}
int main()
{   
    freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);
    int n,op,x;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d%d",&op,&x);
        if(op==1) insert(x);
        else if(op==2) remove(x);
        else if(op==3) printf("%d",find(x));
    }
    return 0;
}