#include <iostream>
#include<bits/stdc++.h>
#include<fstream>
#include<vector>

using namespace std;
#define nr_prim 1000001

vector<int> v[nr_prim];

int cauta(int x)
{
    int nr = x % nr_prim;
    for(int i =0;i<v[nr].size();i++)
        if(v[nr][i] == x)
            return i;
    return -1;
}
void adauga(int x)
{
    int nr = x % nr_prim;
    if(cauta(x)==-1)
        v[nr].push_back(x);
}
void sterge(int x)
{
    int nr = x % nr_prim;
    if(cauta(x) != -1)
    {
        int i = cauta(x);
        v[nr][i] = *v[nr].end();
        v[nr].pop_back();
    }

}


int main()
{
    ifstream f("hashuri.in");
    ofstream g("hashuri.out");
    int n,k;
    long long nr;
    f>>n;
    for(int i=0;i<n;i++)
    {
        f>>k;
        f>>nr;
        if(k == 1)
            adauga(nr);
        if(k==2)
            sterge(nr);
        if(k==3)
            if(cauta(nr)!= -1)
                g<<1<<endl;
            else
                g<<0<<endl;
    }




    return 0;
}