#include <fstream>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <string.h>
#include <queue>
#include <math.h>
#include <set>
 
#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)
#define abs(a) ((a<0)?-a:a)
#define REP(i,a,b) \
	for (int i=a; i<=b; i++)
 
#define INF 10000000000001
 
using namespace std;
 

#ifndef TEST
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
#else
ifstream fin ("input.txt");
ofstream fout ("output.txt");
#endif
 
#define MAXN 100000
#define MOD 666013

typedef long long ll;

vector<int> Hashmap [MOD];
int n;

int search(int key)
{
	for (int i=0; i<Hashmap[key%MOD].size(); i++)
		if (Hashmap[key%MOD][i]==key) return i;
	return -1;	
}

void erase(int key)
{
	int i=search(key);
	if (i+1) Hashmap[key%MOD].erase(Hashmap[key%MOD].begin()+i);
}

int main()
{
	fin>>n;

	for (int i=0; i<n; i++)
	{
		int x,y;
		fin>>x>>y;
		switch (x)
		{
		case 1:
			Hashmap[y%MOD].push_back(y);
			break;
		case 2:
			erase(y);
			break;
		case 3:
			if (search(y)+1) fout<<"1\n";
			else fout << "0\n";
			break;
		}
	}

    return 0;
}