#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n;
unordered_map<int,int>hash_map;

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