#include <cstdio>
#include <vector>

#define prim 7919

using namespace std;

int n;
vector <int> a[prim];

void adauga(int x){
    int p = x % prim;
    for(unsigned int i = 0; i < a[p].size(); ++ i){
        if(a[p][i] == x){
            return;
        }
    }
    a[p].push_back(x);
}

void scoate(int x){
    int p = x % prim;
    for(unsigned int i = 0; i < a[p].size(); ++ i){
        if(a[p][i] == x){
            a[p].erase(a[p].begin() + i);
            return;
        }
    }
}

void verifica(int x){
    int p = x % prim;
    for(unsigned int i = 0; i < a[p].size(); ++ i){
        if(a[p][i] == x){
            printf("1\n");
            return;
        }
    }
    printf("0\n");
}

void citire(){
    int caz;
    int x;

    scanf("%d", &n);
    while(n --){
        scanf("%d %d", &caz, &x);
        if(caz == 1){
            adauga(x);
        }
        if(caz == 2){
            scoate(x);
        }
        if(caz == 3){
            verifica(x);
        }
    }
}

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

    citire();

    return 0;
}