#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#include <deque>
#include <algorithm>
#include <set>
#define Nmax 200005
#define INF 0x3f3f3f3f
#define ll long long
#define MOD 666013

using namespace std;

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

int n, op, x;
set <int> s[MOD+5];
set <int> ::iterator it;

int main()
{
    f >> n;

    while (n--)
    {
        f >> op >> x;
        int md=x%MOD;
        if (op == 1)
        {
            s[md].insert(x);
        }
        else if (op == 2)
        {
            it=s[md].find(x);
            if (it!=s[md].end()) s[md].erase(it);
        }
        else if (op == 3)
        {
            if (s[md].find(x)!=s[md].end()) g << "1\n";
            else g << "0\n";
        }
    }

    return 0;
}