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

typedef long long LL;

const int N = 2e6 + 5, L = 20;

int q, n, OP[N], d[N], T[N], X[N], Y[N], cnt[2];

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

int c[2][N], e[2][N];

void inline add(int x, int k, int o) {
	cnt[o] += k, e[o][x] += k;
	for (; x <= n; x += x & -x) c[o][x] += k;
}

int inline ask(int x, int o) {
	int res = 0;
	for (; x; x -= x & -x) res += c[o][x];
	return res;
}

char buf[1<<23], *p1=buf, *p2=buf, obuf[1<<23], *O=obuf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1<<21, stdin), p1 == p2) ? EOF : *p1++)

void inline read(int &x) {
    x = 0; char s = getchar();
    while (s < '0' || s > '9') s = getchar();
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
}

void print(int x) {
    if (x >= 10) print(x / 10);
    putchar((x % 10) + '0');
}

void inline query() {
	int p = 0, x = 0, y = cnt[1];
	for (int i = L; ~i; i--) {
		if ((p | (1 << i)) > n) continue;
		int u = x + c[0][p | (1 << i)], v = y - e[1][p] - c[1][p | (1 << i)] + e[1][p | (1 << i)];
		if (u <= v) p |= (1 << i), x = u, y = v;
	}
	int ans = min(x, y);
	if (p < n) {
		x += e[0][p + 1], y -= e[1][p];
		if (min(x, y) >= ans) {
			ans = min(x, y); int pos = p + 1;
			p = 0, x = 0, y = cnt[1];
			for (int i = L; ~i; i--) {
				if ((p | (1 << i)) > n) continue;
				int u = x + c[0][p | (1 << i)], v = y - e[1][p] - c[1][p | (1 << i)] + e[1][p | (1 << i)];
				if ((p | (1 << i)) <= pos || min(u, v) == ans) p |= (1 << i), x = u, y = v;
			}
		}
	}
	if (ans == 0) puts("Peace");
	else printf("%d %d\n", d[p], 2 * ans);
}

int main() {
	scanf("%d", &q);
	for (int i = 1; i <= q; i++) {
		read(OP[i]); read(T[i]);
		if (OP[i] == 1) read(X[i]), read(Y[i]), d[++n] = X[i];
	}
	sort(d + 1, d + 1 + n);
	n = unique(d + 1, d + 1 + n) - d - 1;
	for (int i = 1; i <= q; i++) if (OP[i] == 1) X[i] = get(X[i]);
	for (int i = 1; i <= q; i++) {
		if (OP[i] == 1) add(X[i], Y[i], T[i]);
		else add(X[T[i]], -Y[T[i]], T[T[i]]);
		query();
	}
	return 0;
}