#include <fstream>
#include <iostream>
#include <set>
#include <vector>

using namespace std;

#define HASH_SIZE	196613

set<int> table[HASH_SIZE];

int main()
{
	int N, op, x;
	fstream fin("hashuri.in", fstream::in);
	fstream fout("hashuri.out", fstream::out);
	
	fin >> N;
	//cout << N << endl;
	
	cout << sizeof(set<int>) << " " << sizeof(vector<int>) << endl;
	
	for (int i=0; i<N; ++i)
	{
		fin >> op >> x;
		
		switch (op)
		{
			case 1:
			{
				table[x % HASH_SIZE].insert(x);
			}; break;
			
			case 2:
			{
				table[x % HASH_SIZE].erase(x);
			}; break;
		
			case 3:
			{
				fout << ((table[x % HASH_SIZE].find(x) != table[x % HASH_SIZE].end()) ? 1 : 0) << "\n";
			}; break;
		}
	}
	
	fin.close();
	fout.close();
	return 0;
}