#include <bits/stdc++.h>

using namespace std;
unordered_map < int, int > m;
int main()
{
    int n,t,x;
    freopen("hashuri.in","r",stdin);
    freopen("hashuri.out","w",stdout);
    scanf("%d",&n);
    for (int i=1; i<=n; ++i)
    {
        scanf("%d%d",&t,&x);
        if (t==1)
        {

            m[x]=1;
            continue;
        }
        if (t==2)
        {
            m[x]=0;
            continue;
        }
        if (m[x]==1) printf("%d\n",1);
            else printf("0\n");
    }
    return 0;
}