#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");

int n,tip,val,linia;
vector < int > V[MOD+1];

inline int cauta(int val)
{
    for(int j=0; j < V[linia].size(); j++)
    {
        if(V[linia][j] == val) return j;
    }
    return -1;
}

inline void adauga(int val)
{
    if(cauta(val) < 0) V[linia].push_back(val);
}

inline void sterge(int val)
{
    if(cauta(val) >= 0) swap(V[linia][cauta(val)], V[linia][V[linia].size()-1]), V[linia].pop_back();
}

int main()
{
    fin >> n;
    for(int i=1; i<=n; i++)
    {
        fin >> tip >> val;
        linia = val % MOD;

        if(tip == 1) adauga(val);
        else if(tip == 2) sterge(val);
        else
        {
            if(cauta(val) < 0) fout << "0\n";
            else fout << "1\n";
        }
    }
    fout.close();
    return 0;
}