#include <cstdio>
#include <vector>
#define mod 199999

using namespace std;

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

void baga(int x)
{
    int y = x % mod;
    for (int i = 0; i < a[y].size(); ++ i){
        if(a[y][i] == x){
            return;
        }
    }
    a[y].push_back (x);
}

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

bool cauta(int x)
{
    int y = x % mod;
    for (int i = 0; i < a[y].size(); ++ i){
        if(a[y][i] == x){
            return true;
        }
    }
    return false;
}

void citire()
{
    scanf ("%d", &n);
    while (n --){
        int caz;
        int x;
        scanf ("%d %d", &caz, &x);
        if (caz == 1){
            baga(x);
            continue;
        }
        if (caz == 2){
            scoate(x);
            continue;
        }
        printf ("%d\n", cauta(x));
    }
}

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

    citire();

    return 0;
}