#include <bits/stdc++.h>
#define dd(x) cout << #x << "\n"
#define d(x) cout << #x  << ": " << x << "\n"
using namespace std;
#define int long long
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using a3 = array<int, 3>;
const int inf = 0x3f3f3f3f3f3f3f3fLL;
const int N = 1e5 + 5;


// pair<int, int> pre[N];
int fin1[N], fin2[N], lst[N];

string padding(string x) {
    if(x.size() == 1) return "0" + x;
    return x;
}

string toTime(int x) {
    return padding(to_string(x / 60)) + ":" + padding(to_string(x % 60));
}

int ask(int time, int id) {
    cout << "at " << toTime(time) << " check " << id << endl;
    string res;
    cin >> res;
    return res == "awake";
}

int query[N], ans[N];
int positive(int x) {
    return ((x % 1440) + 1440) % 1440;
}

void solve() {
    int n; cin >> n;

    int now = 43;
    for(int i = 1; i <= 100; i++) {
        query[i] = query[i - 1] + now;
        --now;
        if(query[i] > 720) break;
    }
    query[23] = 719;

    vector<int> init(n + 1);
    
    for(int i = 1; i <= n; i++) {
        init[i] = ask(0, i);
    }

    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int,3>>> Q;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= 23; j++) {
            Q.push({query[j], j, i});
        }
    }

    memset(lst, -1, sizeof lst);
    while(!Q.empty()) {
        auto [time, q, id] = Q.top(); Q.pop();
        if(q && fin1[id]) continue;
        if(!q && fin2[id]) continue;

        int res = ask(time, id);
        if(!q) {
            if(lst[id] != -1 && lst[id] != res) {
                ans[id] = (res ? positive(time - 720) : time);
                fin2[id] = 1;
            }
            lst[id] = res;
        } else {
            if(res != init[id]) {
                for(int i = query[q - 1]; i <= query[q]; i++) {
                    Q.push({positive(i + 720), 0, id});
                }
                fin1[id] = 1;
            }
        }
    }

    cout << "answer" << endl;
    for(int i = 1; i <= n; i++) {
        if(!ans[i]) {
            if(init[i] == 1) {
                cout << toTime(720) << endl;
            } else {
                cout << toTime(0) << endl;
            }
        } else cout << toTime(ans[i]) << endl;
    }
}

signed main() {
    // ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    while(T--) solve();
    return 0;
}

/*
2
awake
awake
asleep
*/