#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;


vector<int> Hash[3000];
int A, B, N;


int main()
{
    freopen("hash.in", "r", stdin);
    freopen("hash.out", "w", stdout);
    int i;
    scanf("%i", &N);
    for(; N; N --)
    {
          scanf("%i %i", &A, &B);
          if(A == 1)
          {
               int aux = B % 3000;
               if(find(Hash[aux].begin(), Hash[aux].end(), B) == Hash[aux].end())
                                          Hash[aux].push_back(B);
          }
          if(A == 2)
          {
               int aux = B % 3000;
               if(find(Hash[aux].begin(), Hash[aux].end(), B) != Hash[aux].end())
                                          Hash[aux].erase(find(Hash[aux].begin(), Hash[aux].end(), B));
          }
          if(A == 3)
          {
               int aux = B % 3000;
               if(find(Hash[aux].begin(), Hash[aux].end(), B) == Hash[aux].end()) printf("0\n");
               else printf("1\n");
          }
    }
    return 0;
}