#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    queue<pair<int,int>>q;
    int sum =0;
    vector<int>bs;
    for(int i=1; i<=n;i++)
    {
        int x;
        cin>>x;
            sum+=x;
            bs.push_back(x);
            q.push({i,x});
    }

    int qn=3;
    vector<pair<int,int>>v;
    while (!q.empty())
    {
        pair<int,int>p=q.front();
        q.pop();
        if(p.second-qn>0)
        {
            p.second-=3;
            q.push(p);
            v.push_back({p.first,qn});
        }
        else
        {
            v.push_back(p);
        }
    }
    int l=0;
    for(int i=1;i<=n;i++)
    {
        cout<<"Process"<<i;
        cout<<"waiting time : ";
        int j;
        for(j=v.size()-1; j>=0; j--)
        {
            pair< int, int>p=v[j];
            if(p.first==i)
            {
                break;
            }
        }
        int tot=0;
        for(int k=0;k<=j;k++)
        {
            pair<int,int>p=v[k];
            tot+=p.second;
        }
        cout<<tot-bs[l]<<" : turbarount time : ";
        cout<<tot<<endl;
        l++;
    }

    return 0;
}