#include <fstream>
#include <ctime>
#include <cstdlib>
#include <set>
#include <unordered_set>

using namespace std;


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

int N;

unordered_set<int> S;

int main() {

	
	int type; int x;

	fin >> N;
	while(N--) {

		fin >> type >> x;

		switch(type) {	

			case 1: S.insert(x); break;
			case 2:  S.erase(x); break;
			case 3: fout << (S.find(x) != S.end()) << '\n'; break;
		}
	}
	
	return 0;
}