using namespace std;
#include <fstream>
#include <vector>
#define MOD 666013
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int N;
vector<int> V[MOD];
vector <int> :: iterator find(int x)
{
    int list=x % MOD;
    for(unsigned int i=0;i<V[list].size();i++)
        if(x==V[list][i])
            return V[list].begin()+i;
    return V[list].end();
}
void insert(int x)
{
    int list=x % MOD;
    if(find(x)==V[list].end())
        V[list].push_back(x);

}
void del(int x)
{
    int list=x % MOD;
    vector <int> :: iterator it=find(x);
    if(it!=V[list].end())
        V[list].erase(it);
}
void Solve()
{
    fin>>N;
    while(N--)
    {
        int op,x;
        fin>>op>>x;
        if(op==1)
            insert(x);
        if(op==2)
            del(x);
        if (op==3)
            fout<<(find(x)!=V[x%MOD].end())<<'\n';
    }
}
int main()
{
    Solve();
    return 0;
}