#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> h[769553];
int n, element, operatie, i, j, cheie, mod = 769553;

int inserare(int element, int cheie)
{
    for (i = 0; i < h[cheie].size(); i++)
        if(element == h[cheie][i])
            return 0;
    h[cheie].push_back(element);
}
void stergere(int element, int cheie)
{
    for (i = 0; i < h[cheie].size(); i++)
        if(element == h[cheie][i])
            h[cheie].erase(h[cheie].begin()+i);
}
int cautare(int element, int cheie)
{
    for (i = 0; i < h[cheie].size(); i++)
        if(element == h[cheie][i])
            return 1;
    return 0;
}

int main()
{
    f>>n;
    for(j=0; j<n; j++)
    {
        f>>operatie>>element;
        cheie = element % mod;
        switch(operatie)
        {
            case 1:
                {
                    inserare(element, cheie);
                    break;}

            case 2:
                {
                    stergere(element, cheie);
                    break;}
            case 3:
                {
                    g<<cautare(element, cheie)<<endl;
                    break;
                }
        }

    }

}