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

const int mod=100003;
vector<int> H[mod];
int N, tip, x;

void insert(int x)
{
    int r=x%mod;
    vector<int>::iterator itH[r].begin(), fin=H[r].end();
    for (; it!=fin; ++it)
        if(*it==x) return;
    H[r].push_back(x);
}

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

void search(int x)
{
    int r=x%mod;
    vector<int>::iterator itH[r].begin(), fin=H[r].end();
    for (; it!=fin; ++it)
        if (*it==x) { g<<1<<'\n'; return; }
    g<<0<<'\n';
}

int main()
{
    f>>N;
    for (int i=1; i<=N; ++i)
    {
        f>>tip>>x;
        if (tip==1) insert(x);
          else if (tip==2) elimina(x);
            else search(x);
    }
    return 0;
}