#include<algorithm>
#include<stdio.h>
#include<vector>
#include <set>
using namespace std;

set <long long> st;
set<long long>::iterator it;

long long n,q,w;

void be()
{
	it=st.find(w);
	if(it == st.end() )
		st.insert(w);
}
void torol()
{
	it=st.find(w);
	if(it!=st.end())
		st.erase(it);
}
void ki()
{
	it=st.find(w);
	if(it != st.end())
		printf("1\n");
	else
		printf("0\n");
}

int main()
{
	freopen("hashuri.in","r",stdin);
	freopen("hashuri.out","w",stdout);
	scanf("%lld",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%lld%lld",&q,&w);
		switch(q)
		{
		case 1:be();break;
		case 2:torol();break;
		case 3:ki();break;
		default: break;
		}
			
	}
	return 0;
}