#include <iostream>
#include <cstdio>
#include <vector>

#define P 19391

using namespace std;

int n;
vector <vector <int> > hesh;

int cauta(int b)
{
    int a=b%P;
    int len=hesh[a].size();
    for(int k=0;k<len;k++)
        if(hesh[a][k]==b)
            return 1;
    return 0;
}

int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    cin>>n;
    int a,b,len;
    vector <int> aux;
    hesh.assign(P,aux);
    for(int k=1;k<=n;k++)
    {
        scanf("%d %d",&a,&b);
        if(a==1)
            hesh[b%P].push_back(b);
        else
            if(a==2)
            {
                a=b%P;
                len=hesh[a].size();
                for(int k=0;k<len;k++)
                    if(hesh[a][k]==b)
                        hesh[a].erase(hesh[a].begin()+k);
            }
            else
                if(a==3)
                    cout<<cauta(b)<<endl;
    }

    return 0;
}