#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define mt make_tuple

using ll = long long;
using ii = pair<int, int>;
using ll2 = pair<ll, ll>;
using iii = tuple<int, int, int>;

int Q, t1, s[2000005], t[2000005], x[2000005], y[2000005], k[2000005], idx[2000005];
iii c[2000005];

struct node {
	node *left, *right;
	int S, E;
	ll sum0, sum1;
	node(int _s, int _e) : S(_s), E(_e), sum0(0), sum1(0) {
		if (S == E) {
			return;
		}
		int M = (S + E) / 2;
		left = new node(S, M);
		right = new node(M + 1, E);
	}
	void upd(int p, int t, int x) {
		if (S == E) {
			if (t == 0) {
				sum0 += x;
			} else {
				sum1 += x;
			}
			return;
		}
		int M = (S + E) / 2;
		if (p <= M) {
			left->upd(p, t, x);
		} else {
			right->upd(p, t, x);
		}
		sum0 = left->sum0 + right->sum0;
		sum1 = left->sum1 + right->sum1;
	}
	void del(int p) {
		if (S == E) {
			sum0 = sum1 = 0;
			return;
		}
		int M = (S + E) / 2;
		if (p <= M) {
			left->del(p);
		} else {
			right->del(p);
		}
		sum0 = left->sum0 + right->sum0;
		sum1 = left->sum1 + right->sum1;
	}
	int get(ll pf = 0, ll sf = 0) {
		if (S == E) {
			if (pf + sum0 < sf + sum1) {
				return S;
			}
			return -1;
		}
		if (pf + left->sum0 < sf + right->sum1) {
			return max(left->E, right->get(pf + left->sum0, sf));
		} else {
			return left->get(pf, sf + right->sum1);
		}
	}
	ll2 qry(int l, int r) {
		if (l > E || r < S) {
			return mp(0, 0);
		}
		if (l <= S && E <= r) {
			return mp(sum0, sum1);
		}
		auto lq = left->qry(l, r), rq = right->qry(l, r);
		return mp(lq.first + rq.first, lq.second + rq.second);
	}
} *root;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> Q;
	for (int i = 1; i <= Q; i++) {
		cin >> s[i];
		if (s[i] == 1) {
			cin >> t[i] >> x[i] >> y[i];
			c[++t1] = mt(x[i], t[i], i);
		} else {
			cin >> k[i];
		}
	}
	sort(c + 1, c + 1 + t1);
	root = new node(1, t1);
	for (int i = 1; i <= Q; i++) {
		if (s[i] == 1) {
			idx[i] = lower_bound(c + 1, c + 1 + t1, mt(x[i], t[i], i)) - c;
			root->upd(idx[i], t[i], y[i]);
			//~ cout << "+ " << idx[i] << '\n';
		} else {
			root->del(idx[k[i]]);
		}
		pair<ll, int> val;
		int tmp = root->get();
		//~ cout << "TMP " << tmp << '\n';
		for (int temp_d : {tmp - 1, tmp, tmp + 1}) {
			if (!(1 <= temp_d && temp_d <= t1)) {
				continue;
			}
			int temp = get<0>(c[temp_d]);
			auto sums = root->qry(1, temp_d);
			//~ cout << "! " << root->sum0 << ' ' << root->sum1 << '\n';
			//~ cout << "@ " << temp << ' ' << temp_d << ' ' << sums.first << ' ' << sums.second << '\n';
			ll sum0 = sums.first;
			ll sum1 = root->sum1 - sums.second;
			ll cur = min(sum0, sum1);
			val = max(val, mp(cur, temp));
		}
		if (val.first == 0) {
			cout << "Peace\n";
		} else {
			cout << val.second << ' ' << val.first * 2 << '\n';
		}
	}
}