#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin ("hashuri.in");
ofstream fout("hashuri.out");

#define mod 666013
vector <int> G[mod];
int n, a, b;
#define itt vector<int>::iterator

itt find_value (int val)
{
    int hashh = val % mod;
    for (itt i=G[hashh].begin(); i!=G[hashh].end(); i++)
        if (*i == val)
            return i;
    return G[hashh].end();
}

void insertt (int val)
{
    if (find_value(val) == G[val%mod].end())
        G[val%mod].push_back(val);
}

void deletee (int val)
{
    itt pos = find_value (val);
    if (pos!=G[val%mod].end())
        G[val%mod].erase(pos);
}


int main()
{
    fin>>n;
    while (n--)
    {
        fin>>a>>b;
        if (a==1)
            insertt (b);
        if (a==2)
            deletee (b);
        if (a==3)
        {
            if (find_value(b) != G[b%mod].end())    fout<<1<<'\n';
            else    fout<<0<<'\n';
        }
    }

    fout.close();
    return 0;
}