#include <bits/stdc++.h>
#define P 123457

using namespace std;

ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

int x, op, n;
set<int>h[123505];

void Add(int x)
{
    int r = x % P;
    h[r].insert(x);
}

void Erase(int x)
{
    int r = x % P;
    h[r].erase(x);
}

void Find(int x)
{
    int r = x % P;
    if(h[r].find(x) != h[r].end())
        fout << "1\n";
    else fout << "0\n";
}

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
    {
        fin >> op >> x;
        if(op == 1)
            Add(x);
        else if(op == 2)
            Erase(x);
        else
            Find(x);
    }
    return 0;
}