/*#include <iostream>
#include <cstdio>
#include <vector>
#define MOD 666013
using namespace std;
vector< int> v[MOD];
int N,i,f,x,p,j;
int cauta(int x)
{
    p=x%MOD;
    for(j=0;j<v[p].size();j++)
    {
        if(v[p][j]==x)
            return 1;
    }
    return 0;
}
void sterge(int x)
{
    p=x%MOD;
    if(v[p].size()!=0)
    {
        for(j=0;j<v[p].size();j++)
        {
            if(v[p][j]==x)
                v[p].erase(v[p].begin()+j),j=v[p].size();
        }
    }
}
int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    cin>>N;
    for(i=1;i<=N;i++)
    {
        cin>>f>>x;
        if(f==1)
        {
            if(cauta(x)==0)
                p=x%MOD,v[p].push_back(x);
        }
        else
        {
            if(f==2)
            {
                sterge(x);
            }
            else
            {
                cout<<cauta(x)<<"\n";
            }
        }
    }
    return 0;
}*/
#include<fstream>
#define MOD 666013
#define MAXN 666016
#include<vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector < int> G[MAXN];
int n,op;
long long int x;
int search(int x){
    int poz=x%MOD;
    for(int i=0;i<G[poz].size();++i){
        if(G[poz][i]==x)
            return 1;
    }
    return 0;
}
void adauga(int x){
    if(!search(x)){
      int  p=x%MOD;
        G[p].push_back(x);
    }
}
void sterge(int x){
	int p=x%MOD;
    if(G[p].size()){
	  for(int i=0;i<G[p].size();++i)
		if(x==G[p][i])
        G[p].erase(G[p].begin()+i);
    }


}

int main(){
f>>n;
    for(int i=1;i<=n;++i){

        f>>op>>x;
        if(op==1)
            adauga(x);
        else
            if(op==2)
                sterge(x);
            else{
                g<<search(x)<<'\n';
            }
         //afis(i);
    }
}