#include <cstdio>
#include <vector>
#include <unordered_set>

using namespace std;

const int MOD = 666013;

vector<int> l[MOD];

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

void insertValue(int x)
{
    int i = x % MOD;
    if (findValue(x) == l[i].end())
        l[i].push_back(x);
}

void deleteValue(int x)
{
    int i = x % MOD;
    vector<int>::iterator it = findValue(x);
    if (it != l[i].end())
        l[i].erase(it);
}

unordered_set<int> set1;

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

    int n;
    scanf("%d", &n);
    for (int i = 1, t, x; i <= n; i++)
    {
        scanf("%d%d", &t, &x);
        if (t == 1)
            set1.insert(x);
        else if (t == 2)
            set1.erase(x);
        else
        {
            if (set1.find(x) != set1.end())
                printf("1\n");
            else
                printf("0\n");
        }
    }

    return 0;
}