#include <bits/stdc++.h>
using namespace std;
const int N = 105;
const vector<int> tks = {0, 48, 95, 141, 186, 230, 273, 315, 356, 396, 435, 473, 510, 546, 581, 615, 648, 680, 711, 720};
int n;
int a[N];
bool query(int t, int x) {
    printf("at %02d:%02d check %d\n", t / 60, t % 60, x+1);
    fflush(stdout);
    char ret[10];
    scanf("%s", ret);
    return ret[1] == 'w';
}

void report() {
    puts("answer");
    for (int i = 0; i < n; ++i) {
        int t = a[i];
        printf("%02d:%02d\n", t / 60, t % 60);
    }
    fflush(stdout);
    exit(0);
}

int blk[N], stat[N];

map<int, set<int> > S;

int main() {
    cin >> n;
    for (int i = 0; i < n; ++i) blk[i] = -1;
    for (int id = 0; id < tks.size(); ++id) {
        int tk = tks[id];
        if (!tk) {
            for (int i = 0; i < n; ++i) {
                stat[i] = query(tk, i);
            }
            continue;
        }
        for (int i = 0; i < n; ++i) if (blk[i] == -1) {
            if (query(tk, i) != stat[i]) blk[i] = id - 1;
        }
    }
    for (int i = 0; i < n; ++i) S[blk[i]].insert(i);
    for (auto &[id, s] : S) {
        map<int, bool> cstat;
        for (auto u : s) cstat[u] = query(720 + tks[id], u);
        for (int t = 720 + tks[id] + 1; t < 720 + tks[id+1]; ++t) {
            for (auto it = begin(s); it != end(s);) {
                int u = *it;
                if (cstat[u] != query(t, u)) {
                    if (cstat[u]) a[u] = t;
                    else a[u] = (t+720) % 1440;
                    it = s.erase(it);
                } else ++it;
            }
        }
        for (auto u : s) {
            int t = 720 + tks[id+1];
            if (cstat[u]) a[u] = t % 1440;
            else a[u] = (t+720) % 1440;

        }
    }
    report();
    return 0;
}