#include<iostream>
#include<cstring>
#include<vector>
#include<cassert>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    int n;
    scanf("%d", &n);
    const int all = 1440;

    vector<int> cnt(n);

    int pre = 0;

    auto ask = [&](int x, int y){
        assert(y >= pre);
        pre = y;
        assert(++cnt[x] <= 50);
        if (y == all) y = 0;
        int h = y / 60;
        int m = y % 60;
        printf("at %02d:%02d check %d\n", h, m, x + 1);
        fflush(stdout);
        string s;
        cin >> s;
        return s == "asleep";
        // if (res[x] < all / 2){
        //     return y >= res[x] and y < res[x] + all / 2; 
        // }
        // else{
        //     return y >= res[x] or y < res[x] - all / 2;
        // }
        // return false;
    };


    vector<int> p;
    p.push_back(0);
    vector<int> last(all, -1);
    for(int i = 48; i >= 1; i--){
        p.push_back(p.back() + i);
    }
    for(int i = 1; i < p.size(); i++){
        last[p[i]] = p[i - 1];
    }

    vector<int> remain, ans(n), state(n);
    for(int i = 0; i < n; i++){
        remain.push_back(i);
        state[i] = ask(i, 0);
    }

    vector<vector<int> > pos(all + 1);

    for(int i = 1; i < all; i++){
        if (last[i] != -1){
            vector<int> nreamin;
            for(auto x : remain){
                if (ask(x, i) != state[x]){
                    if (i == last[i] + 1){
                        if (state[x] == 0){
                            ans[x] = i;
                        }
                        else{
                            ans[x] = (i + all / 2) % all;
                        }
                    }
                    else{
                        pos[last[i] + all / 2 + 1].push_back(x);
                    }
                }
                else{
                    nreamin.push_back(x);
                }
            }
            remain.swap(nreamin);
        }
        for(auto x : pos[i]){
            if (ask(x, i) != state[x]){
                if (i + 1 == all){
                    if (state[x] == 0){
                        ans[x] = (i + 1 + all / 2) % all;
                    }
                    else{
                        ans[x] = (i + 1) % all;
                    }
                }
                else{
                    pos[i + 1].push_back(x);
                }
            }
            else{
                if (state[x] == 0){
                    ans[x] = (i + all / 2) % all;
                }
                else{
                    ans[x] = i;
                }
            }
        }
    }
    puts("answer");
    for(int i = 0; i < n; i++){
        printf("%02d:%02d\n", ans[i] / 60, ans[i] % 60);
    }
    fflush(stdout);

}