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

#define mod 666013
using namespace std;

int n;
vector<int> v[mod];

vector<int>::iterator find_value(int x)
{
    return find(v[x%mod].begin(),v[x%mod].end(),x);
}

void erase_value(int x)
{
    int list = x % mod;
    vector<int>::iterator it=find_value(x);
    if(it != v[list].end())
        v[list].erase(it);
}

void insert_value(int x)
{
    int list = x % mod;
    if(find_value(x) == v[list].end())
        v[list].push_back(x);
}

int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);

    scanf("%d ",&n);
    int x,op;
    for(int i=1;i<=n;i++)
    {
        scanf("%d %d",&op,&x);
        if(op==1)
        {
            insert_value(x);
            continue;
        }
        if(op==2)
        {
            erase_value(x);
            continue;
        }
        printf("%d\n", find_value(x)!= v[x%mod].end());
    }
    return 0;
}