#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

#define primeNr 66013
vector<int> hashTable[66023];

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

void Add(int X){

    hashTable[X%primeNr].push_back(X);
}

void Erase(int X){

    int index = X % primeNr;

    for(int i = 0; i < hashTable[index].size(); i++)

            if(hashTable[index][i] == X)
                hashTable[index].erase(hashTable[index].begin() + i);
}

int Search(int X){

    int index = X % primeNr;

    for(int i=0; i< hashTable[index].size(); i++)
        if(hashTable[index][i] == X)
            return 1;

    return 0;
}

int main(){
    int n, operation, nr;
    f >> n;
    for(int i=1;i<=n;i++) {
        f >> operation >> nr;

        if(operation == 1)
            Add(nr);
        else if(operation== 2)
            Erase(nr);
        else
            g << Search(nr) << endl;
}
    f.close();
    g.close();
    return 0;
}