#include <fstream>
#include <vector>
#include <unordered_set>
using namespace std;

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

unordered_set<int> A;
int n;

int main()
{
	int op, x;
	is >> n;
	for(int i = 1; i<= n; ++i)
	{
		is >> op >> x;
		if(op == 1)
		{	
			A.insert(x);
			break;	
		}
		else
		if(op == 2)
		{	
			A.erase(x);		
			break;
		}
		else
		if(op == 3)
		{
			os << (A.find(x) != A.end()) << '\n';
			break;
		}
	
	}
	is.close();
	os.close();
	return 0;
}