#include <stdio.h>
#include <stdlib.h>
#include <fstream>
#include <vector>

#define MAX 1000003


using namespace std;

typedef struct Cell{
	int info;
	Cell *urm;
} List, *AList;

typedef struct{
	AList *lists;
} Hash;

ifstream in("hashuri.in");
ofstream out("hashuri.out");

int N;

int HashFunction(int x){

	int h = x % MAX;
	return h;
}


AList * CheckIntoHash(AList *al, int x){

	while((*al) != NULL){
		if((*al)->info == x){
			return al;
		}
		al = &(*al)->urm;
	}

	return NULL;
}


void AddToHash(AList *al, int x){

	if(CheckIntoHash(al, x) != NULL)
		return;

	AList aux = (AList)malloc(sizeof(List));

	aux->info = x;

	aux->urm = *al;
	*al = aux;
}

void RemoveFromHash(AList *al, int x){

	if(CheckIntoHash(al, x) == NULL)
		return;

	AList aux = *al;
	*al = (*al)->urm;
	free(aux);
}


void readFromFile(){

	in >> N;

	Hash hash;
	hash.lists = (AList *)calloc(MAX, sizeof(AList));

	int op, x;
	for(int i = 0; i < N; ++i){
		in >> op >> x;

		int h = HashFunction(x);

		if(op == 1)
			AddToHash(&hash.lists[h], x);
		if(op == 2)
			RemoveFromHash(&hash.lists[h], x);
		if(op == 3){
			if(CheckIntoHash(&hash.lists[h], x) == NULL)
				out << 0 << "\n";
			else out << 1 << "\n";
		}
	}
}


int main(){

	readFromFile();
	return 0;
}