#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
typedef pair <int, int> pii;

inline int read() {
	int x = 0, f = 0;
	char c = getchar();
	while (!isdigit(c)) {if (c == '-') f = 1; c = getchar();}
	while (isdigit(c)) x = (x << 1) + (x << 3) + (c & 15), c = getchar();
	return f? -x : x;
}

struct node {
	int x, y, w;
	inline node() {}
	inline node(int x_, int y_, int w_) {x = x_, y = y_, w = w_;}
};
inline bool operator < (const node &x, const node &y) {
	return x.w < y.w;
}

node mx[4];
inline node chk(node p, int o) {
	const node ze = node(0, 0, 0);
	if (o == 1 && p.x == mx[0].x) return ze; //different x
	if (o == 2 && p.y == mx[0].y) return ze; //different y
	if (o == 3 && (p.x == mx[0].x || p.y == mx[0].y)) return ze; //x & y
	return p;
}

void upd(node x) {
	if (mx[0].w < x.w)
		swap(mx[0], x);
	static int pp[4] = {3, 2, 1, 2};
	for (int i = 0; i < 4; ++i) {
		int j = pp[i];
		node p1 = chk(mx[j], j);
		node p2 = chk(x, j);
		if (p1 < p2) swap(mx[j], x);
	}
}

int main() {
	int Q = read(), ans = 0;
	while (Q--) {
		int op = read();
		if (op == 1) {
			int x = read(), y = read(), w =read();
			x ^= ans;
			y ^= ans;
			w ^= ans;
			upd(node(x, y, w));
		}
		else {
			int x = read(), y = read();
			x ^= ans;
			y ^= ans;
			ans = 0;
			for (int i = 0; i < 4; ++i) {
				if (mx[i].x != x && mx[i].y != y)
					ans = max(ans, mx[i].w);
			}
			printf("%d\n", ans);
		}
	}
	return 0;
}