#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>

#define pib pair<int, bool>
#define pii pair<int, int>

using namespace std;

int n;

const int HALF_DAY = 720;
const int DAY = 1440;

vector<pib> results[110];
priority_queue<pii, vector<pii>, greater<>> que;
int res[110];

bool AskSleep(int time, int x) {
    string s;
    cout << "at " << setw(2) << time / 60 << ':' << setw(2) << time % 60 << " check " << x << endl;
    cin >> s;
    return s[1] == 's';
}

void Answer() {
    cout << "answer" << endl;
    for (int i = 1; i <= n; i++) {
        cout << setw(2) << res[i] / 60 << ':' << setw(2) << res[i] % 60 << endl;
    }
}

void AskOne() {
    auto [t, p] = que.top();
    que.pop();
    results[p].push_back({t, AskSleep(t, p)});
    if (t > HALF_DAY) {
        if (results[p].back().second == results[p][0].second) {
            if (results[p][0].second) {
                res[p] = t;
                return;
            }
            res[p] = t - HALF_DAY;
            return;
        }
        if (t == DAY - 1) {
            if (results[p][0].second) {
                res[p] = 0;
                return;
            }
            res[p] = HALF_DAY;
            return;
        }
        // cout << results[p].size() << endl;
        if (results[p].size() == 50) {
            if (results[p][0].second) {
                res[p] = t + 1;
                return;
            }
            res[p] = t - HALF_DAY + 1;
            return;
        }
        que.push({t + 1, p});
        return;
    }
    if (results[p].back().second != results[p][0].second) {
        que.push({results[p][results[p].size() - 2].first + 1 + HALF_DAY, p});
        return;
    }
    que.push({min(HALF_DAY, t + 50 - (int)results[p].size()), p});
}

void Solve() {
    cout << setfill('0');
    cin >> n;
    // Answer();
    // AskSleep(0, 1);
    for (int i = 1; i <= n; i++) {
        que.push({0, i});
    }
    while (que.size()) {
        AskOne();
    }
    Answer();
}

int main() {
    ios::sync_with_stdio(false);
    Solve();
    return 0;
}