#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");

const int mod=666013;
vector <int> H[mod+1];
int N, tip, x;

bool find(int x)
{
    int r=x%mod;
    vector <int>::iterator it=H[r].begin();
    for (; it!=H[r].end(); ++it)
        if (*it==x) return 1;
    return 0;
}

void insert(int x)
{
    int r=x%mod;
    vector <int>::iterator it=H[r].begin();
    if (!find(x)) H[r].push_back(x);
}

void erase(int x)
{
    int r=x%mod;
    vector <int>::iterator it=H[r].begin();
    for (; it!=H[r].end(); ++it)
        if (*it==x)
        {
            *it=H[r].back(); H[r].pop_back();
            break;
        }
}

int main()
{
    f>>N;
    for (int i=1; i<=N; ++i)
    {
        f>>tip>>x;
        if (tip==1) insert(x);
            else if (tip==2) erase(x);
                else g<<find(x)<<'\n';
    }
    return 0;
}