/*
 * has.cpp
 *
 *  Created on: Apr 1, 2012
 *      Author: M
 */

#include <fstream>
#include <set>
using namespace std;

#define prim 20011
set <int> H[prim];

int main() {
	ifstream fin("hashuri.in");
	FILE *fout = fopen("hashuri.out","w");
	int n,op,x;
	fin>>n;
	while(n) {
		--n;
		fin>>op>>x;
		switch (op) {
			case 1: {
				H[x%prim].insert(x);
				break;
			}
			case 2: {
				H[x%prim].erase(x);
				break;
			}
			case 3: {
				if(H[x%prim].find(x)==H[x%prim].end())
					fprintf(fout,"0\n");
				else
					fprintf(fout,"1\n");
			}

		}
	}
}