#include <cstdio>
#include <fstream>
#include <cstdlib>
#include <utility>
#include <algorithm>
#include <bitset>
#include <vector>
#include <map>
#include <queue>
#include <string>
#include <cstring>


#define ll long long
#define llu unsigned long long
#define rep(i, a, b) for (int i = (a) ; i <= (b) ; ++i)

#define mp make_pair
#define pii pair <int, int>
#define SORT(x) sort ((x).begin(), (x).end() )
#define fi first

using namespace std;

map <int, int> Hasis;

int main(){
    ifstream fin ("hashuri.in");
    ofstream fout ("hashuri.out");
    int N, query, bit, pw;
    pw = 0;
    fin >> N;
    for (; N; N--) {
            fin >> query >> bit;
            if (query == 1 && Hasis.find(bit) == Hasis.end()) Hasis[bit] = ++pw;
            if (query == 2 ) Hasis.erase(bit);
            if (query == 3 ) {
                    int ans = Hasis.find(bit) != Hasis.end();
            fout<<ans<<"\n";}
    }
    return 0;



}