#include <iostream>
#include <fstream>
#include <stdio.h>
#include <vector>
 
using namespace std;
#define MOD 666013
ifstream f("hashuri.in");
ofstream g("hashuri.out");
 
int N;
vector<int> G[MOD];
 
int find_value(int x)
{
    int list = x % MOD;
    vector<int>::iterator it;
 
    for (it = G[list].begin(); it != G[list].end(); ++it)
        if (*it == x)
            return 1;
    return 0;
}
 
void insert_value(int x)
{
    int list = x % MOD;    
    if (find_value(x) == G[list].end())
        G[list].push_back(x);
}
 
void erase_value(int x)
{
    int list = x % MOD;
    vector<int>::iterator it = find_value(x);
    
    if (it != G[list].end())
        G[list].erase(it);
}
 
int main()
{
    f >> N;
    for (int i = 1; i <= N; i++)
    {
        int op, x;
	f >> op >> x;
        if (op == 1) // inserare
        {
            insert_value(x);
            continue;
        }
        if (op == 2) // stergere
        {
            erase_value(x);
            continue;
        }
        g << find_value(x) << "\n";
    }
 
    return 0;
}