#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#include <vector>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)
#define eb emplace_back

using namespace std;

typedef unsigned long long ULL;
constexpr int N = 200005;

struct Vset {
	int t, x, y, z, w;
	bool contain(int sx, int sy) const {
		if (t == 5) {
			return false;
		}
		if (t == 4) {
			return x == sx && y == sy;
		}
		if (t == 3) {
			return x == sx && y == sy || z == sx && w == sy;
		}
		if (t == 1 && y == sy || t == 2 && x == sx || t == 0 && (x == sx || y == sy)) {
			return true;
		}
		return false;
	}
	bool contain(const Vset &s) const {
		if (s.t == 5) {
			return true;
		}
		if (s.t == 4) {
			return contain(s.x, s.y);
		}
		if (s.t == 3) {
			return contain(s.x, s.y) && contain(s.z, s.w);
		}
		if (t > 2) {
			return false;
		}
		if (s.t == 2) {
			return t != 1 && x == s.x;
		}
		if (s.t == 1) {
			return t != 2 && y == s.y;
		}
		return t == 0 && x == s.x && y == s.y;
	}
};

constexpr Vset emt = (Vset){5};

Vset operator & (const Vset &a, const Vset &b) {
	if (a.t > b.t) {
		return (b & a);
	}
	if (a.contain(b)) {
		return b;
	}
	if (b.t > 3) {
		return emt;
	}
	if (b.t == 3) {
		if (a.contain(b.x, b.y)) {
			return (Vset){4, b.x, b.y};
		}
		if (a.contain(b.z, b.w)) {
			return (Vset){4, b.z, b.w};
		}
		return emt;
	}
	if (b.t == 2) {
		return a.t == 2 ? emt : (Vset){4, a.y, b.x};
	}
	if (b.t == 1) {
		return a.t == 1 ? emt : (Vset){4, a.x, b.y};
	}
	if (a.t || b.t) {
		LOG("ERR\n");
		while (true);
	}
	if (a.y == b.y) {
		return (Vset){1, 0, a.y};
	}
	if (a.x == b.x) {
		return (Vset){2, a.x, 0};
	}
	return (Vset){3, a.x, b.y, a.y, b.x};
}

struct Dat {
	int x, y, c;
	bool operator < (const Dat &t) const {
		return c > t.c;
	}
};
vector<Dat> v;

void ex(int x, int y, int c) {
	const Dat &t = {x, y, c};
	v.insert(lower_bound(v.begin(), v.end(), t), t);
	Vset andS = (Vset){0, v[0].x, v[0].y};
	for (int i = 1; i < v.size(); ++i) {
		bool ers = (andS.t == 5);
		int cx = 0, cy = 0;
		for (int j = 0; j < i; ++j) {
			if (v[i].x == v[j].x && v[i].y == v[j].y) {
				ers = true;
			}
			if (v[i].x == v[j].x) {
				++cx;
			}
			if (v[i].y == v[j].y) {
				++cy;
			}
		}
		ers |= (cx >= 2 || cy >= 2);
		if (ers) {
			v.erase(v.begin() + i);
		} else {
			andS = andS & (Vset){0, v[i].x, v[i].y};
		}
	}
}

int qry(int tx, int ty) {
	for (auto [x, y, c] : v) {
		if (x != tx && y != ty) {
			return c;
		}
	}
	return 0;
}

int main() {
	int q;
	scanf("%d", &q);
	int t, x, y, c, last = 0;
	while (q--) {
		scanf("%d%d%d", &t, &x, &y);
		x ^= last, y ^= last;
		if (t == 1) {
			scanf("%d", &c);
			c ^= last;
			ex(x, y, c);
		} else {
			printf("%d\n", last = qry(x, y));
		}
	}
	return 0;
}