#include <bits/stdc++.h>

using namespace std;

#define P 777013
vector < int > h[P];

void Adauga(int x)
{
    int r;
    r = x % P;
    for(auto w : h[r])
        if(w == x)
            return;
    h[r].push_back(x);
}

void Stergere(int x)
{
    int r, L, i;
    r = x % P;
    L = h[r].size();
    for(i = 0; i < L; i++)
        if( x == h[r][i])
    {
        h[r][i] = h[r][L-1];
        h[r].pop_back();
        return;
    }
}

int Cauta(int x)
{
    int r, ok = 0;
    r = x % P;
    for(auto v :h[r])
        if(v == x)
            return 1;
    return 0;
}

int main()
{
    int n, op, x;
    ifstream fin("hashuri.in");
    ofstream fout("hashuri.out");
    fin >> n;
    while(n--)
    {
        fin >> op >> x;
        if(op == 1)
            Adauga(x);
        if(op == 2)
            Stergere(x);
        if(op == 3)
            fout << Cauta(x) <<"\n";
    }
    fin.close();
    fout.close();
    return 0;
}