using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <algorithm>

#define score 100
#define pb push_back
#define sz size
#define f first
#define s second
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define mp make_pair


typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;

map<int,int> M;

int main()
{
	int N,x,y,nr;
	
	freopen("hashuri.in","r",stdin);
	freopen("hashuri.out","w",stdout);
	
	scanf("%d",&N);
	for(++N;--N;)
	{
		scanf("%d%d",&x,&y);
		if(x==1 && M.find(y) == M.end() )
			M[y] = ++nr;
		if(x==2)
			M.erase(y);
		if(x==3)
			printf("%d\n",M.find(y) != M.end() );
	}
	
	return 0;
}