/***************************************************
 * Alex Palcuie
 * Romania - 2013
 * alex [dot] palcuie [at] gmail [dot] com
 * http://palcu.blogspot.com/
****************************************************/

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iterator>
#include <cstring>

using namespace std;

// Defines
#define NAME(n) #n
#define pr(x) db((x), (#x))
#define prv(v,n) dbv((v), (#v), (n))
#define prw(v) dbw((v), (#v))
#define X first
#define Y second
#define pb push_back

// Helpers
template <typename T>
inline void db(const T x, const char * name){
	cerr << name << " = " << x << '\n';
}
template <typename T> inline void dbv(const T * v, const char * name, int n){
	fprintf(stderr, "=== %s ===\n", name);
	for(int i=0; i<n; i++)
		cerr << v[i] << " ";
	cerr << '\n';
}
template <typename T> inline void dbs(T x){
	cerr << x << ' ';
}

template<typename T>
void dbw(const std::vector<T>& t, const char * name){
	fprintf(stderr, "=== %s ===\n", name);
	unsigned n = t.size();
	for(typename std::vector<T>::size_type i=0; i<n; ++i)
		std::cerr << t[i] << ' ';
	cerr << '\n';
}

// Structs

// Constants
const int N = 1<<10;
const int INF = 0x3f3f3f3f;
const int MOD = 699967;

// Globals
list<int> v[MOD];
int nOperatii;

// Functions
bool check(int x){
    int key = x % MOD;
    list<int>::iterator it;
    for(it = v[key].begin(); it != v[key].end(); it++)
        if(*it == x)
            return true;
    return false;
}

void add(int x){
    int key = x % MOD;
    if(!check(x))
        v[key].push_back(x);
}

void remove(int x){
    int key = x % MOD;
    list<int>::iterator it;
    for(it = v[key].begin(); it != v[key].end(); it++)
        if(*it == x){
            v[key].erase(it);
            return;
        }
}


int main(){
	#ifndef ONLINE_JUDGE
	freopen("hashuri.in","r",stdin);
	freopen("hashuri.out","w",stdout);
	#endif

	scanf("%d", &nOperatii);
	for(int i=0; i<nOperatii; i++){
        int op, x;
        scanf("%d%d", &op, &x);
        if(op == 1) add(x);
        else if (op == 2) remove(x);
        else printf("%d\n", (int)check(x));
	}



	return 0;
}