#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <unordered_map>

using namespace std;

unordered_map<int, int> m;

int main()
{
    ifstream f("hashuri.in");
    ofstream g("hashuri.out");
    int n;

    f >> n;

    for (int i = 0; i < n; i++)
    {
        int com, arg;
        f >> com >> arg;

        if (com == 1)
            m[arg] = 1;
        else if (com == 2)
            m[arg] = 0;
        else if (com == 3)
            g << m[arg] << endl;
    }
    return 0;
}