#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define ll long long
using namespace std;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
    while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
const int N=2e6+5;
struct node{int id,v;}b[N];
bool cmp(node a,node b){return a.v<b.v;}
int n,m,tot,op[N],t[N],x[N],y[N],c[N];
int t1[N],t2[N];
inline void add(int *t,int x,int v){
    for(;x<=m;x+=x&-x)t[x]+=v;
}
inline int Q(int x){
    int res=0;
    for(;x;x-=x&-x)res+=t2[x];
    return res;
}
int main(){
    n=read();
    rep(i,1,n){
        op[i]=read();
        if(op[i]==1){
            t[i]=read(),x[i]=read(),y[i]=read();
            b[++tot]={i,x[i]};
        }else{
            t[i]=read();
        }
    }
    sort(b+1,b+tot+1,cmp);
    rep(i,1,tot){//离散化
        if(b[i].v!=b[i-1].v){
            c[++m]=b[i].v;
        }
        x[b[i].id]=m;
    }
    rep(i,1,n){
        //修改
        if(op[i]==1){
            if(t[i]==0)add(t1,x[i],y[i]);
            else add(t2,1,y[i]),add(t2,x[i]+1,-y[i]);
        }else{
            int id=t[i];
            if(t[id]==0)add(t1,x[id],-y[id]);
            else add(t2,1,-y[id]),add(t2,x[id]+1,y[id]);
        }
        //查询
        int now=0,sum1=0,sum2=0;
        per(i,20,0){//冰系和更小的情况下，在树状数组上二分
            if(now+(1<<i)>m)continue;
            if(sum1+t1[now+(1<<i)]<sum2+t2[now+(1<<i)]){
                now+=(1<<i);
                sum1+=t1[now],sum2+=t2[now];
            }
        }
        if(now==m){
            if(sum1==0)puts("Peace");
            else printf("%d %d\n",c[now],sum1<<1);
            continue;
        }
        int sum=Q(now+1),p=0,psum=0;
        per(i,20,0){//火系和更小时同样做二分
            if(p+(1<<i)>m)continue;
            if(psum+t2[p+(1<<i)]>=sum){
                p+=(1<<i);
                psum+=t2[p];
            }
        }
        if(max(sum,sum1)<=0)puts("Peace");
        else if(sum1>sum)printf("%d %d\n",c[now],sum1<<1);
        else printf("%d %d\n",c[p],sum<<1);
    }
    return 0;
}