#include <bits/stdc++.h>

using namespace std;

ifstream f("hashuri.in");
ofstream g("hashuri.out");

const int mod = 666013;
int n;
vector <int> v[mod];

int find_value(int x){
    int list = x % mod;
    for(int it = 0 ; it < v[list].size() ; it++)
        if(v[list][it] == x)
            return it;
    return -1;
}

void insert_value(int x){
    int list = x % mod;
    if(find_value(x) == -1)
        v[list].push_back(x);
}

void erase_value(int x){
    int list = x % mod;
    int it = find_value(x);
    if(it != -1)
        v[list].erase(v[list].begin() + it);

}

int main(){
    int type,x;
    f >> n;
    while(n--){
        f >> type >> x;
        if(type == 1){
            insert_value(x);
        }else
            if(type == 2)
                erase_value(x);
            else
                g << (find_value(x) != -1) << "\n";
    }

    return 0;
}