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

int main(){
    int n;scanf("%d",&n);
    int lst=0;
    int cnt[6][6]={},a=5,b=5;
    multiset<pair<int,int>> S;
    queue<int> Q[2];
    while(n--){
        int aa,bb,c,d;char e[6];
        scanf("%d:%d.%d %d %s",&aa,&bb,&c,&d,e);
        int t=aa*600+bb*10+c;
        while(!S.empty()&&S.begin()->first<=t){
            auto [x,y]=*S.begin();S.erase(S.begin());
            cnt[a][b]+=x-lst;lst=x;
            (y?b:a)++;
        }d--;
        for(int x:{0,1}) while(!Q[x].empty()&&Q[x].front()<=t) Q[x].pop();
        cnt[a][b]+=t-lst;lst=t;
        switch(e[1]){
            case 'i':Q[d].push(t+1200);S.emplace(t+1200,d);(d?b:a)--;break;
            case 'a':S.emplace(t+3000,d);(d?b:a)--;break;
            case 'o':
                if(d&&a<b){
                    if(!Q[0].empty()) a++,S.erase(S.find({Q[0].front(),0})),Q[0].pop();
                }
                if(!d&&a>b){
                    if(!Q[1].empty()) b++,S.erase(S.find({Q[1].front(),1})),Q[1].pop();
                }
                break;
        }
    }
    int t=36000;
    while(!S.empty()&&S.begin()->first<=t){
        auto [x,y]=*S.begin();S.erase(S.begin());
        cnt[a][b]+=x-lst;lst=x;
        (y?b:a)++;
    }
    cnt[a][b]+=t-lst;
    for(int i=0;i<=5;i++)
    for(int j=0;j<=5;j++){
        if(cnt[i][j])printf("%dx%d %02d:%02d.%d\n",i,j,cnt[i][j]/600,cnt[i][j]%600/10,cnt[i][j]%10);
    }
}