#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define MOD 666013

using namespace std;

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

vector <int> a[MOD+5];
int n, cer, x;

int main()
{
    f >> n;
    for (int i = 1; i <= n; i++)
    {
        f >> cer >> x;
        if(cer == 1)
        {
            a[x%MOD].push_back(x);
        }
        else if(cer == 2)
        {
            auto it=find(a[x%MOD].begin(), a[x%MOD].end(), x);
            if(it!=a[x%MOD].end()) a[x%MOD].erase(it);
        }
        else
        {
            auto it=find(a[x%MOD].begin(), a[x%MOD].end(), x);
            if(it!=a[x%MOD].end()) g << "1" << '\n';
            else g << "0" << '\n';
        }
    }

    return 0;
}