//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>

using namespace std;

#include <fstream>
ifstream cin("hashuri.in"); ofstream cout("hashuri.out");
int c, n, nr;
unordered_map <int, int> M;

int main() {

	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> c >> nr;
		if (c == 1) {
			M[nr] = 1;
		}
		if (c == 2) {
			M[nr] = 0;
		}
		if (c == 3) {
			return M[nr];
		}
	}

	return 0;
}