#include <bits/stdc++.h>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
set <int> table[100005];
void insertt(int x)
{
    int mod=x%100000;
    table[mod].insert(x);
}
void erasee(int x)
{
    int mod=x%100000;
    table[mod].erase(x);
}
bool findd(int x)
{
    int mod=x%100000;
    return table[mod].find(x)!=table[mod].end();
}
int main()
{
    int n;
    in >> n;
    for(int i=1; i<=n; i++)
    {
        int x,y;
        in >> x >> y;
        switch(x)
        {
            case 1: insertt(y); break;
            case 2: erasee(y); break;
            case 3: cout << findd(y) << '\n'; break;
        }
    }
    return 0;
}