#include <bits/stdc++.h>

using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
#define modl 666013
#define pb push_back
vector <int> v[666015];
int n;
bool gasit(int nr)
{
    for(auto i : v[nr % modl])
        if(i == nr)
            return 1;

    return 0;
}
int main()
{
    fin >> n;
    for(int i = 1, op, x; i <= n; ++i)
    {
        fin >> op >> x;
        if(op == 1)
        {
            if(!gasit(x))
                v[x % modl].pb(x);
        }
        else if(op == 2)
        {
            for(int i = 0; i < v[x % modl].size(); ++i)
                if(v[x % modl][i] == x)
                {
                    swap(v[x% modl][i], v[x % modl].back());
                    v[x % modl].pop_back();
                }
        }
        else fout << gasit(x) << '\n';
    }
    return 0;
}