#include <bits/stdc++.h>
using namespace std;

vector< vector<long long> > v;
int k,p = 666103,a,q;
long long b;
//
void insertElement(long long f)
{
    for(int i = 0 ; i < v[q].size(); i++)
    {
        if(v[q][i] == f) return;
    }
    v[q].push_back(f);
}

bool isInSet(long long f)
{
    for(int i = 0 ; i < v[q].size() ; i++)
        if(v[q][i] == f) return true;
    return false;
}

void erase_hash(long long f)
{
    int lim = v[q].size();
    for(int i = 0 ; i < lim; i++)
    {
        if(v[q][i] == f)
        {
            v[q][i] = v[q][lim-1];
            v[q].pop_back();
        }
    }
}

int main()
{

freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
    v.resize(4000);
    cin >> k;
    for(int i = 0 ; i < k; i++)
    {
        cin >> a >> b;
        q = b%p;


        if(a == 1)
        {
            insertElement(b);
        }
        if(a == 2)
        {
            erase_hash(b);
        }
        if(a == 3)
        {
            cout << (isInSet(b)) ? "1" : "0";
            cout << "\n";
        }
    }

    return 0;
}