#include <fstream>
#include <vector>
#define HASH 699109

using namespace std;
vector<int> L[HASH];
vector<int>::iterator it;

int T, t, v;

int find(int v) {
    int r = v % HASH;
    for (it = L[r].begin();it!=L[r].end();it++)
        if (*it == v) {
            return 1;
        }
    return 0;
}

void insert(int v) {
    int r = v % HASH;
    if (!find(v))
        L[r].push_back(v);
}

void erase(int v) {
    int r = v % HASH;
    for (it = L[r].begin();it!=L[r].end();it++)
        if (*it == v) {
            L[r].erase(it);
            break;
        }
}



int main() {
    ifstream fin("hashuri.in");
    ofstream fout("hashuri.out");

    for (fin>>T;T;T--) {
        fin>>t>>v;
        if (t == 1)
            insert(v);
        else
            if (t == 2)
                erase(v);
            else {
                fout<<find(v)<<"\n";
            }
    }

    return 0;
}