#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

typedef long long ll;

const ll mod=1e4+7;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define PI 3.14159265358979

using namespace std;
const int nmax=100007;
ll t;

//rezolvare prin hash table

vector<int>v[nmax];
bool find(int x) {
	for (auto it:v[x%mod]) {
		if (it==x)return 1;
	}
	return 0;
}


void insert(int x) {
	if (!find(x)) {
		v[x%mod].pb(x);
	}
}
void erase(int x) {
	for (int i=0; i<sz(v[x%mod]); i++) {
		if (x==v[x%mod][i]) {
			swap(v[x%mod][i],v[x%mod].back());
			v[x%mod].pop_back();
		}
	}
}

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	ifstream cin("hashuri.in");
	ofstream cout("hashuri.out");
	ll n;
	cin >> n;
	while (n--) {
		ll x,v;
		cin >> x >> v;
		if (x==1) {
			insert(v);
		}
		if (x==2) {
			erase(v);
		}
		if (x==3) {
			cout <<find(v) << '\n';
		}
	}


}