#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int M = 60;
const int H = 24;
const int D = H * M;

string f(int x) {
    if (x <= 9) {
        return "0" + to_string(x);
    } else {
        return to_string(x);
    }
}

string convert(int t) {
    int hour = t / M;
    int minute = t % M;
    return f(hour) + ":" + f(minute);
}

const int N = 100 + 10;

const bool debug = false;
int kek[N];

bool query(int i, int t) {
    cout << "at " << convert(t) << " check " << i << endl;
    string res;
    if (debug) {
        if ((t - kek[i] + D) % D < D / 2) {
            res = "asleep";
        } else {
            res = "awake";
        }
        cout << res << endl;
    } else {
        cin >> res;
    }
    return res == "awake";
}


int state[N][D + 10];
int l[N], r[N];
int ans[N];
vector<int> times;

void answer(int n) {
    cout << "answer" << endl;
    for (int i = 1; i <= n; i++) {
        cout << convert(ans[i]) << endl;
    }
}

void work_first(int i, int t_id) {
    if (l[i] == -1) {
        int t = times[t_id];
        state[i][t] = query(i, t);
        if (t_id >= 1 && state[i][t] != state[i][times[t_id - 1]]) {
            l[i] = times[t_id - 1];
            r[i] = times[t_id];
        }
    } else {
        // do nothing
    }
}

void work_second(int i, int t) {
    if (l[i] + D / 2 < t && t < r[i] + D / 2) {
        state[i][t] = query(i, t);
    } else {
        // do nothing
    }
}

int main() {
//    ios_base::sync_with_stdio(false);
//    cin.tie(nullptr);
//#ifdef LOCAL
//    freopen("input.txt", "r", stdin);
//#endif

    for (int i = 0, j = 48; i < D / 2;) {
        times.push_back(i);
        i += j + 1;
        j--;
    }
    times.push_back(D / 2);

    int n;

    if (debug) {
        mt19937 rnd;
        cout << "REAL:" << endl;
        n = 5;
        cout << n << "\n";
        for (int i = 1; i <= n; i++) {
            kek[i] = rnd() % D;
            cout << convert(kek[i]) << endl;
        }
        cout << endl;
    } else {
        cin >> n;
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < D; j++) {
            state[i][j] = -1;
        }
        ans[i] = -1;
        l[i] = r[i] = -1;
    }

    for (int t_id = 0; t_id < times.size(); t_id++) {
        for (int i = 1; i <= n; i++) {
            work_first(i, t_id);
        }
    }
    for (int t = D / 2 + 1; t < D; t++) {
        for (int i = 1; i <= n; i++) {
            work_second(i, t);
        }
    }

    for (int i = 1; i <= n; i++) {
        state[i][l[i] + D / 2] = state[i][l[i]] ^ 1;
        state[i][r[i] + D / 2] = state[i][r[i]] ^ 1;
        for (int j = l[i] + D / 2; j + 1 <= r[i] + D / 2; j++) {
            if (state[i][j] != state[i][j + 1]) {
                ans[i] = state[i][j] == 1 ? (j + 1) % D : (j + 1 + D / 2) % D;
                break;
            }
        }
    }

    answer(n);

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}