#include <bits/stdc++.h>

using namespace std;
const int NMAX = 1e6 + 2, MOD = 666013;

ifstream fin("hashuri.in"); ofstream fout("hashuri.out");

int n, q, x;
bool ok, okk;
vector <long long> v[15];

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> q >> x;
        if(q == 1){
            okk = true;
            for(int i = 0; i < v[x % MOD].size(); i++){
                if(v[x % MOD][i] == x){
                    okk = false;
                    break;
                }
            }

            if (okk) v[x % MOD].push_back(x);
        }

        else if(q == 2){
            for(int i = 0; i < v[x % MOD].size(); i++)
                if(v[x % MOD][i] == x)
                    v[x % MOD].erase(v[x % MOD].begin() + i);
        }
        else {
            ok = false;
            for(int i = 0; i < v[x % MOD].size(); i++){
                if(v[x % MOD][i] == x) {
                    ok = true;
                    break;
                }
            }

            if(ok) fout << "1" << '\n';
            else fout << "0" << '\n';

        }
    }
    return 0;
}