#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
struct du {
    int t, d;
    char s[40];
} a[10010];
int n, t;
inline int cmp1(du x, du y) {
    return (x.t < y.t || (x.t == y.t && strcmp(x.s, y.s)<0));
}
int main() {
    freopen("hey.in", "r", stdin);
    freopen("hey.out", "w", stdout);
    scanf("%d\n", &n);
    for(int i=0; i<n; i++)
        scanf("%d %s %d\n", &a[i].t, a[i].s, &a[i].d);
    sort(a, a+n, cmp1);
    t = a[0].t;
    for(int i=0; i<n; i++) {
        if(a[i].t <= t) {
            printf("%s went out at time %d\n", a[i].s, t);
            t += a[i].d;
        } else {
            printf("%s went out at time %d\n", a[i].s, a[i].t);
            t = a[i].d + a[i].t;
        }
    }
    return 0;
}