#include<fstream>
#include<vector>
#define MOD 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

vector <int> V[MOD];
int N;

int Find(int Val)
{
    int List=Val%MOD,i;

    for(i=0;i<(int)V[List].size();++i)
        if(V[List][i]==Val) return i;

    return -1;
}

void Insert(int Val)
{
    int List=Val%MOD;
    if(Find(Val)==-1)   V[List].push_back(Val);
}

void Delete(int Val)
{
    int List = Val % MOD;
    int Pos = Find(Val);
    if(Pos != -1)
            V[List].erase(V[List].begin() + Pos);
}

int main()
{
    int i;

    fin>>N;

    for(i=1;i<=N;++i)
    {
        int op,x;   fin>>op>>x;

        if(op==1)   Insert(x);
        else
            if(op==2)   Delete(x);
            else    fout<<(Find(x)!=-1)<<"\n";
    }

    fin.close();
    fout.close();
    return 0;
}