#include<iostream>
#include <vector>
#define ll long long int

#define MOD 666013
#define NMAX MOD+2
using namespace std;
vector<ll> v[NMAX];
ll t;
ll i;
int main()
{
	cin >> t;
	while (t--)
	{
		ll op, value;
		cin >> op >> value;
		if (op == 1)
		{
			ll place = value % MOD;
			bool find = 0;
			for (i = 0; i < v[place].size() && !find; i++)
				if (v[place][i] == value)
					find = 1;
			if (!find)
				v[place].push_back(value);

		}
		else
			if (op == 2)
			{
				ll place = value % MOD;
				bool find = 0;
				for (i = 0; i < v[place].size() && !find; i++)
					if (v[place][i] == value)
						find = 1;
				if (find)
					v[place].erase(v[place].begin() + i - 1);

			}
			else
			{
				ll place = value % MOD;
				bool find = 0;
				for (i = 0; i < v[place].size() && !find; i++)
					if (v[place][i] == value)
						find = 1;
				cout << find << '\n';
			}
	}
	return 0;
}