#include <bits/stdc++.h>

using namespace std;
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
const int MOD = 666013;

vector < int > v[MOD];

int Query (int x)
{
    int line = x % MOD;
    for (int i = 0; i < v[line].size(); i++)
    {
        if (v[line][i] == x)
        return 1;
    }
    return 0;
}

void Delete (int x)
{
    int line = x % MOD;
    for (int i = 0; i < v[line].size(); i++)
    {
        if (v[line][i] == x)
        {
            v[line].erase(v[line].begin() + i);
            return;
        }
    }
}
void Insert (int x)
{
    int line = x % MOD;
    if (Query(x) == 0)
    {
        v[line].push_back(x);
    }
}
int main()
{
    int n, type, x;
    f >> n;
    for (int i = 1; i <= n; i++)
    {
        f >> type >> x;
        switch (type)
        {
            case 1: Insert(x); break;
            case 2: Delete(x); break;
            case 3: g << Query(x) << "\n"; break;
        }
    }
    return 0;
}