#include<iostream>
#include<fstream>
#include<vector>
#define m 666013
#define val x%m
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector <int> Hash[m];
int n;
vector<int>::iterator find_val(int x)
{
vector<int>::iterator it;
for(it=Hash[val].begin();it!=Hash[val].end();it++)
if(*it==x)
    return it;
return Hash[val].end();
}
void add(int x)
{
    if(find_val(x)==Hash[val].end())
        Hash[val].push_back(x);
}
void dell(int x)
{
    if(find_val(x)!=Hash[val].end())
    Hash[val].erase(find_val(x));
}
int main()
{int x,op;
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>op>>x;
        if(op==1)add(x);
        if(op==2)dell(x);
        if(op==3)
            if(find_val(x)==Hash[val].end())
            fout<<0<<endl;
        else
            fout<<1<<endl;
    }
return 0;
}