#include <iostream>
#include <vector>
#include <fstream>
#define MOD 100003
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int N;
vector<int>Hash[MOD];




void Sterge(int x)
{
    int mod = x % MOD;
    for (int i = 0; i < Hash[mod].size(); i++)
        if (Hash[mod][i] == x) { Hash[mod][i] = -1; return; }


}

int Vf(int x)
{
    int mod = x % MOD;
    for (int i = 0; i < Hash[mod].size(); i++)
        if (Hash[mod][i] == x) return 1;
    return 0;
}
void Adauga(int x)
{
    int i;
    int mod = x % MOD;
    /* for (i = 0; i < Hash[mod].size(); i++)
         if (Hash[mod][i] == x) return;*/
    if (!Vf(x))
        Hash[mod].push_back(x);
}

int main()
{
    int op, x, i;
    fin >> N;
    for(i = 0; i < N; i++)
    {
        fin >> op >> x
        if (op == 1) Adauga(x);
        if (op == 2) Sterge(x);
        if(op == 3)fout << Vf(x) << "\n";

    }

    fin.close();
    fout.close();

    return 0;
}