#include <iostream>
#include <fstream>
#include <vector>

#define MOD 66013
using namespace std;

vector<int> hash[MOD];
long n;

void adaugare (int x)
{
    int niv = x%MOD;
    hash[ niv ].push_back(x);
}


bool verificare(int x)
{
    int niv = x%MOD;
    for(int i=0;i<hash[niv].size();++i)
        if(hash[niv][i] == x)
            return 1;
    return 0;
}

void stergere (int x)
{
    int niv = x%MOD;
    for(int i=0;i<hash[niv].size();++i)
        if(hash[niv][i] == x)
            hash[niv].erase(hash[niv].begin() + i);
}
int main()
{
    int n,op,x,i;
    ifstream f("hashuri.in");
    ofstream g("hashuri.out");
    f>>n;
    for(i=1; i<=n; i++)
    {
        f>>op>>x;
        if(op==1)
            adaugare(x);
        if(op==2)
            stergere (x);
        if(op==3)
            g<<verificare(x)<<endl;
    }
    return 0;
}