#include <bits/stdc++.h>

using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");

const int HASH_MAX = 1000007;

int n, op, x;
unordered_map <int, bool> fr;

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> op >> x;
        if(op == 1){
            fr[x] = 1;
        }
        else if(op == 2){
            fr[x] = 0;
        }
        else{
            fout << fr[x] << "\n";
        }
    }
    return 0;
}