#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");

int main()
{
    int a, b, n;
    f >> n;

    unordered_map<int,int> hashmap;
    unordered_map<int,int>::iterator x;
    for (int i = 0; i < n; ++i)
    {
        f >> a;
        switch (a)
        {
        case 1:
            f >> b;
            hashmap.insert(make_pair(b, 1));
            break;
        case 2:
            f >> b;
            x=hashmap.find(b);
            if (x != hashmap.end())
                hashmap.erase(b);
            break;
        case 3:
            f >> b;
            x=hashmap.find(b);
            if (x != hashmap.end())
                g << 1 << endl;
            else
                g << 0 << endl;
            break;
        default:
            break;
        }
    }
    return 0;
}