#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;

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

int n;
int x, tip;
vector<int> G[MOD];

vector<int>::iterator Find(int x);
void Insert(int x);
void Erase(int x);

int main()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
    {
        fin >> tip >> x;
        if (tip == 1) Insert(x);
        if (tip == 2) Erase(x);
        if (tip == 3)
                if (Find(x) == G[x % MOD].end()) fout << "0\n";
                else fout << "1\n";
  
    }
    fin.close();
    fout.close();
    return 0;
}


vector<int>::iterator Find(int x)
{
    int table = x % MOD;
    for (vector<int>::iterator it = G[table].begin(); it != G[table].end(); ++it)
        if (*it == x)
                return it;
    return G[table].end();
}                      

void Insert(int x)
{
    if (Find(x) == G[x%MOD].end())
        G[x%MOD].push_back(x);   
}


void Erase(int x)
{
    vector<int>::iterator it = Find(x);
    if (it == G[x%MOD].end()) return;
    G[x%MOD].erase(it);
}