#include <iostream>
#include <fstream>
#include <vector>

#define M 666013

using namespace std;
vector<int> hash[M];

int find(int x)
{
    int poz = x % M;
    int length = hash[poz].size();
    for (int i = 0; i < length; i++)
    {
        if (hash[poz][i] == x)
            return i;
    }
    return -1;
}

void insert(int x)
{
    int poz = x % M;
    int found = find(x);
    if (found == -1)
    {
        hash[poz].push_back(x);
    }
}

void del(int x)
{
    int poz = x % M;
    int found = find(x);

    if (found > -1)
    {
        hash[poz][found] = hash[poz].back();
        hash[poz].pop_back();
    }
}

int main()
{
    freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);

    int N, op, x;
    for (scanf("%d", &N); N; --N)
    {
        scanf("%d %d", &op, &x);
        if (op == 1) // inserare
        {
            insert(x);
        }
        else if (op == 2)   // stergere
        {
            del(x);
        }
        else if (op == 3)
        {
            printf("%d\n", find(x) > -1);
        }
    }
    return 0;
}