#include<stdio.h>
#include<vector>

#define MOD 666013

using namespace std;

vector<int> a[MOD];
int n, x, c, ct;

void rezolva();

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

    rezolva();

    return 0;
}

void rezolva(){
int i, j, r;
    scanf("%d", &n);

    for (; n; n--){

        scanf("%d %d\n", &c, &x);
        j = x % MOD; r = 0;

        if (c == 1){

            for (i = 0; i < a[j]. size(); i++)
                if (a[j][i] == x)
                    {r = 1; break;}

            if (!r) a[j].push_back(x);

        }

        else

            if (c == 2){

                for (i = 0; i < a[j].size(); i++)
                    if (a[j][i] == x)
                        {
                            r = 1;
                            a[j][i]= a[j][a[j].size()-1];
                            a[j].pop_back();
                            break;
                        }
            }
            else{
                for (i = 0; i < a[j]. size(); i++)
                    if (a[j][i] == x)
                        {printf("1\n");break;}

                if (i == a[j].size())
                    printf("0\n");
            }
    }
}