#include <bits/stdc++.h>
using namespace std;
int ask(int t, int num) {
    printf("at %02d:%02d check %d\n", t / 60, t % 60, num);
    fflush(stdout);
    string s; cin >> s;
    return (s[1] == 'w');
}
int n;
struct node {
    int o, num, h;
};
int x[105], ans[105];
vector<node> v[1445];
int main() {
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        x[i] = ask(0, i);
        v[49].push_back({0, i, 49});
    }
    for(int t = 0; t < 1440; ++t) {
        for(auto [o, i, j] : v[t]) {
            if(!j) ans[i] = t;
            else if(!o) {
                int y = ask(t, i);
                if(x[i] != y) {
                    v[t + 721 - j].push_back({1, i, j - 1});
                } else {
                    v[t + j - 1].push_back({0, i, j - 1});
                }
            } else {
                int y = ask(t, i);
                if(x[i] != y) {
                    v[t + 1].push_back({1, i, j - 1});
                } else {
                    ans[i] = t;
                }
            }
        }
    }
    puts("answer");
    for(int i = 1; i <= n; ++i) {
        if(x[i] >= 1) ans[i] = (ans[i] + 720) % 1440;
        printf("%02d:%02d\n", ans[i] / 60, ans[i] % 60);
    }
    return 0;
}
// 14:01 2:00