#include <cstdio>
#include <algorithm>
#include <vector>
#define Dim 666013

using namespace std;
int n, op, p, i, poz;
vector  <int> v[Dim];
bool Search(int x)
{
    int i;
    for(i = 0; i < v[x % Dim].size(); ++ i)
        if(v[x % Dim][i] == x)
            {poz = i;  return 1;}
    return 0;
}

int main()
{
    freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);
    scanf("%d", &n);
    for(i = 1; i <= n; ++ i)
    {
        scanf("%d %d", &op, &p);
        if(op == 1 && !Search(p))
            v[p % Dim].push_back(p);
        if(op == 2 && Search(p))
            v[p % Dim].erase(v[p % Dim].begin() + poz);
        if(op == 3)
            printf("%d\n", Search(p));
    }
    return 0;
}