#include <stdio.h>
#include <unordered_map>

using namespace std;
int N,NR;
unordered_map<int,int> M;

int main()
{
    freopen("hashuri.in" ,"r",stdin);
    freopen("hashuri.out","w",stdout);
    scanf("%d ", &N);
    int O,V,i;
    for(i=1;i<=N;i++){
        scanf("%d %d ", &O, &V );
        if( O == 1  && M.find( V ) == M.end() ){  M[V]= ++NR; continue;    }
        if( O == 2  ){  M.erase(V); continue; }
        if( O == 3  )   printf("%d\n", M.find( V ) != M.end() );
    }

    return 0;
}