#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAX_N = 100 + 1;
const int MAX_T = 1440;

string t_str(int x) {
    int h = x / 60;
    int m = x % 60;
    string res;
    res += (h < 10 ? "0"+to_string(h) : to_string(h));
    res += ':';
    res += (m < 10 ? "0"+to_string(m) : to_string(m));
    return res;
}

vector<int> reg;
vector<int> check[MAX_T];
int res[MAX_N][MAX_T];

void solve() {
    for (int t=0, dt=49; dt>0; t+=dt--) reg.push_back(t);
    memset(res, -1, sizeof res);

    int n;
    cin >> n;
    for (int i=1; i<=n; ++i) {
        for (int t: reg) check[t].push_back(i);
    }

    vector<int> last_st(n+1, -1);
    for (int t=0; t<MAX_T; ++t) {
        for (int x: check[t]) {
            cout << "at " << t_str(t) << " check " << x << '\n';
            cout.flush();
            string tmp;
            cin >> tmp;
            res[x][t] = (tmp == "awake");
            if (t < MAX_T/2) res[x][t+MAX_T/2] = !res[x][t];
            else res[x][t-MAX_T/2] = !res[x][t];
            if (last_st[x] >= 0 && last_st[x] != res[x][t]) {
                for (int tt: reg) {
                    if (tt <= t) continue;
                    auto it = find(check[tt].begin(), check[tt].end(), x);
                    if (it != check[tt].end()) check[tt].erase(it);
                }
                auto it = find(reg.begin(), reg.end(), t);
                assert(it != reg.begin());
                int pt = *prev(it);
                for (int i=pt+MAX_T/2+1; i<min(t+MAX_T/2, MAX_T); ++i) check[i].push_back(x);
                last_st[x] = -2;
            }
            if (last_st[x] != -2) last_st[x] = res[x][t];
        }
    }

    cout << "answer\n";
    for (int i=1; i<=n; ++i) {
        for (int t=0; t<MAX_T; ++t) {
            int nt = (t+1 == MAX_T ? 0 : t+1);
            if (res[i][t] == 1 && res[i][nt] == 0) {
                cout << t_str(nt) << '\n';
                break;
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();
}