#include <bits/stdc++.h>
#define mod 100003
using namespace std;
int n, x, t, k, i, N;
vector<int>a[mod];
int main()
{
    freopen("hashuri.in", "r", stdin);
    freopen("hashuri.out", "w", stdout);
    scanf("%d", &N);
    for(; N; N--)
    {
        scanf("%d%d", &t, &x);
        k = x % mod;
        i = 0;
        n = a[k].size();
        for(auto it : a[k])
        {
            if(it == x)
                break;
            i++;
        }
        if(t == 1)
        {
            if(i == n)
                a[k].push_back(x);
            continue;
        }
        if(t == 2)
        {
            if(i < n)
            {
                swap(a[k][i], a[k][n - 1]);
                a[k].pop_back();
            }
            continue;
        }
        i < n ? printf("1\n") : printf("0\n");
    }
    return 0;
}