#include <algorithm>
#include <array>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int query(int t, int d) {
    t %= 1440;
    int h = t / 60, m = t % 60;
    printf("at %02d:%02d check %d\n", h, m, d);
    fflush(stdout);
    char s[10];
    scanf("%s", s);
    return s[1] == 's';
}
void solve() {
    int n;
    cin >> n;
    int cur = 0, pre = 0;
    vector<int> vis(n + 1, 1), sta(n + 1), ans(n + 1, -1);
    for (int i = 1; i <= n; i++) {
        if (!vis[i])
            continue;
        sta[i] = query(cur, i);
    }
    vector<vector<int>> change(1441, vector<int>());
    vector<array<int, 3>> tag(1441);
    for (int i = 49; i >= 1; i--) {
        pre = cur;
        cur += i;
        if (cur >= 720)
            cur = 720;
        for (int j = 1; j <= n; j++) {
            if (!vis[j])
                continue;
            int d = query(cur, j);
            if (d != sta[j]) {
                tag[pre + 720] = {pre, cur, i};
                change[pre + 720].push_back(j);
                vis[j] = 0;
            }
        }
        if (cur == 720)
            break;
    }
    for (int i = 0; i <= 1440; i++) {
        if (change[i].size() == 0)
            continue;
        auto [pre, cur, t] = tag[i];
        int last = pre + 720;
        for (int j = 1; j <= t - 1; j++) {
            int tim = last + j;
            for (auto x : change[i]) {
                if (ans[x] != -1)
                    continue;
                int d;
                if (tim >= 1440)
                    d = sta[x];
                else
                    d = query(tim, x);
                if (d == sta[x]) {
                    ans[x] = tim;
                }
            }
        }
        for (auto x : change[i]) {
            if (ans[x] == -1)
                ans[x] = cur + 720;
            if (sta[x] == 0)
                ans[x] -= 720;
            ans[x] = (ans[x] % 1440 + 1440) % 1440;
        }
    }
    printf("answer\n");
    for (int i = 1; i <= n; i++) {
        int h = ans[i] / 60, m = ans[i] % 60;
        printf("%02d:%02d\n", h, m);
    }
}
int main() {
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}