// Skyqwq
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long LL;

const int N = 8e5 + 5, INF = 1e9;

int n, d[N], tot, c[N], X[N], Y[N], W[N], len;

int inline get(int x) {
	return lower_bound(d + 1, d + 1 + tot, x) - d;
}

void inline add(int x, int y, int w) {
	x = get(x), y = get(y);
	c[x] ^= w, c[y] ^= w;
}

void inline push(int x) {
	d[++tot] = x;
}

void inline work(int x, int y, int w) {
	d[++tot] = x - 1, d[++tot] = y;
	y++;
	X[++len] = x, Y[len] = y, W[len] = w;
	d[++tot] = x, d[++tot] = y;
}

int main() {
	scanf("%d", &n);
	d[++tot] = 0;
	for (int i = 1; i <= n; i++) {
		int op, x, y, w; scanf("%d%d", &op, &x);
		if (op == 1) {
			scanf("%d%d", &y, &w);
			work(x, y, w);
		} else if (op == 2) scanf("%d", &w), work(x, x, w);
		else if (op == 3) scanf("%d", &w), work(-INF, x - 1, w), work(x + 1, INF, w);
	}
	sort(d + 1, d + 1 + tot);
	tot = unique(d + 1, d + 1 + tot) - d - 1;
	for (int i = 1; i <= len; i++) add(X[i], Y[i], W[i]);
	int ans = -2e9, id = 2e9;
	for (int i = 1; i <= tot; i++) {
		c[i] ^= c[i - 1];
		if (c[i] > ans) ans = c[i], id = d[i];
		else if (c[i] == ans) {
			if (abs(d[i]) < abs(id) || (abs(d[i]) == abs(id) && d[i] > id))
				id = d[i];
		}
	}
	printf("%d %d\n", ans, id);
	return 0;
}