#include <iostream>
#include <algorithm>
#include <cstdio>
#include <bitset>
#pragma GCC optimize("Ofast")
using namespace std;
const int dim=1<<17;
char next_ch()
{
    static char buff[dim];
    static int bp=dim;
    if(bp==dim)
    {
        bp=0;
        fread(buff,1,dim,stdin);
    }
    return buff[bp++];
}
void get(int &a)
{
    a=0;
    char ch;
    do
    {
        ch=next_ch();
    }
    while(ch<'0'&&'9'<ch);
    do
    {
        a=a*10+ch-'0';
        ch=next_ch();
    }
    while('0'<=ch&&ch<='9');
}
unordered_map <int,bool> harta;
int main()
{
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    ios::sync_with_stdio(0);
    cout.tie(NULL);
    cin.tie(NULL);
    int n,i,x,a,b;
    get(n);
    for(i=1; i<=n; i++)
    {
        get(a);
        get(b);
        if(a==1)
            harta[b]=1;
        else if(b==2)
            harta[b]=0;
        else
            cout<<harta[b]<<'\n';
        
    }
    return 0;
}