/// hashuri
#include <iostream>
#include <fstream>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <math.h>
#define NMax 1000001
#define P 73
///#define f cin
///#define g cout
using namespace std;

ifstream f("hashuri.in");
ofstream g("hashuri.out");

int cod, n, x, ans;
vector<int> M[NMax];
map<int, int> m;

void add(int x)
{
    int nr = x % P;
    for(int i = 0; i < M[nr].size(); ++i) /// verific daca mai exista elementul in multime
        if(M[nr][i] == x) return;
    M[nr].push_back(x);
}
void remove1(int x)
{
    int nr = x % P; /// hashul...
    for(int i = 0; i < M[nr].size(); ++i) /// caut elementul
        if(M[nr][i] == x)
        {
            M[nr].erase(M[nr].begin() + i); /// il sterg
            return;
        }
}
bool query(int x) /// verific daca exista
{
    int nr = x % P;
    for(int i = 0; i < M[nr].size(); ++i)
        if(M[nr][i] == x) return true;
    return false;
}

int main()
{
    f >> n;
    for(int i = 1; i <= n; ++i)
    {
        f >> cod >> x;
        if(cod == 1)
        {
            //add(x);
            if(m.find(x) == m.end()) m[x] = ++ans;
        }
        else if(cod == 2)
        {
            ///remove1(x);
            m.erase(x);
        }
        ///else if(query(x)) g << 1 << '\n';
        ///else g << 0 << '\n';
        else printf("%d\n", m.find(x) != m.end());
    }
    return 0;
}