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

#define k 666013

vector <int> Hash[k+3];

int main()
{
    int n, op, nr, clasa;
    f>>n;

        for (int i = 1; i <= n; i++)
    {
        f>>op>>nr;
        clasa = nr % k;
        if(op == 1)
        {
            int ok = 0;
            for(int j = 0; j < Hash[clasa].size(); j++)
                if(Hash[clasa][j] == nr)
                    ok = 1;
            if(ok == 0)
                Hash[clasa].push_back(nr);
        }

        if(op == 2)
        {
            for(int j = 0; j < Hash[clasa].size(); j++)
                if(Hash[clasa][j] == nr)
                {
                    swap(Hash[clasa][j], Hash[clasa][Hash[clasa].size() - 1]);
                    Hash[clasa].pop_back();
                }
        }
        int ok = 0;
        if(op == 3)
        {
            for(int j = 0; j < Hash[clasa].size(); j++)
                if(Hash[clasa][j] == nr)
                {
                    g<<1<<'\n';
                    ok = 1;
                }
            if(ok == 0)
                g<<0<<'\n';
        }

    }

    return 0;
}