#include <fstream>
#include <set>
#define mod 666013

using namespace std;

ifstream f("hashuri.in");
ofstream g("hashuri.out");

int t, nr, cer, x, c;
set <int> a[mod];

int main()
{
    for (f >> t; t; t--)
    {
        f >> cer >> x;  c = x%mod;
        if (cer == 1 && a[c].find(x) == a[c].end())
            a[c].insert(x);
        else if (cer == 2)
            a[c].erase(x);
        else if (cer == 3)
            g << (a[c].find(x) != a[c].end()) << '\n';
    }
    return 0;
}