#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int m=666013;
vector<int> H[m];
vector<int>::iterator it;
int h(int key)
{
  return key%m;
}
int main()
{
     int n,i,op,key,idx;
     freopen("hashuri.in","r",stdin);
     freopen("hashuri.out","w",stdout);
     scanf("%d",&n);
     for(i=1;i<=n;i++)
     {
         scanf("%d%d",&op,&key);
         idx=h(key);
         if(op==1)
         {
           it=find(H[idx].begin(),H[idx].end(),key);
           if(it==H[idx].end())
             H[idx].push_back(key);
         }
         if(op==2)
         {
           it=find(H[idx].begin(),H[idx].end(),key);
           if(it!=H[idx].end())
               H[idx].erase(it);
         }
         if(op==3)
         {
           it=find(H[idx].begin(),H[idx].end(),key);
           if(it!=H[idx].end())
              printf("1\n");
           else
              printf("0\n");
         }
     }
     return 0;
}