#include<bits/stdc++.h>
#define int long long
using namespace std;

struct dwarf{
    int queries;
    int awake;
    int asleep;
    bool found;
    bool invert;
};
vector<dwarf> dwarfs(1000);
vector<vector<int>> arr(100, vector<int> (1440));
vector<int> x(100);
void init(){
    for(int i = 0; i < 100; i ++){
        fill(arr[i].begin(), arr[i].end(), 0);
    }
    for(int i = 0; i < 100; i ++){
        x[i] = rand() % 1440;
        for(int j = x[i]; j < x[i] + 720; j ++){
            arr[i][j % 1440] = true;
        }
    }
}
bool ask(int id, int time){
    // if(id == 0)
    cout << "at " << (to_string(time/60).size() == 1 ? "0" : "") << time / 60 << ":" <<(to_string(time%60).size() == 1 ? "0" : "") << time % 60 << " check " << id + 1 << endl;
    dwarfs[id].queries ++;
    // if(id == 0)
    // cout << arr[id][time] << endl;
    // return arr[id][time];
    string ans;
    cin >> ans;
    return ans == "asleep";
}

void solve(){
    int N = 100;
    cin >> N;
    for(auto &i : dwarfs){
        i = (dwarf){0, -1, -1, false, false};
    }

    int s = 40;
    for(int t = 0; t < 720;){
        for(int i = 0; i < N; i ++){
            if(dwarfs[i].asleep == -1){
                if(ask(i, t) ^ dwarfs[i].invert){
                    if(t == 0){
                        dwarfs[i].invert = true;
                        dwarfs[i].awake = t;
                    }
                    else{
                        dwarfs[i].asleep = t;
                    }
                }
                else{
                    dwarfs[i].awake = t;
                }
            }
        }
        if(t == 719){
            break;
        }
        t = min(t + s, 719ll);
        s --;
    }
    for(int i = 0; i < N; i ++){
        if(dwarfs[i].asleep == -1){
            if(dwarfs[i].invert){
                dwarfs[i].asleep = 1439;
            }
            else{
                dwarfs[i].asleep = 1439;
            }
        }
    }
    for(int t = 720; t < 1440; t++){
        for(int i = 0; i < N; i ++){
            if(dwarfs[i].awake < t - 720 && dwarfs[i].asleep > t - 720){
                if(ask(i, t) ^ dwarfs[i].invert){
                    dwarfs[i].asleep = t;
                }
                else{
                    dwarfs[i].awake = t;
                }
            }
        }
    }
    cout << "answer" << endl;
    for(int i = 0; i < N; i ++){
        assert(dwarfs[i].queries <= 50);
        // cout << dwarfs[i].awake << " " << dwarfs[i].asleep << " " << dwarfs[i].invert << endl;
        // assert(dwarfs[i].awake - dwarfs[i].asleep == 1);
        int time;
        if(!dwarfs[i].invert){
            if(dwarfs[i].asleep > dwarfs[i].awake){
                dwarfs[i].awake = dwarfs[i].asleep + 1;
            }
            time = (dwarfs[i].awake + 720) % 1440;
        }
        else{
            if(dwarfs[i].asleep < dwarfs[i].awake){
                dwarfs[i].asleep = dwarfs[i].awake - 1;
            }
            time = (dwarfs[i].asleep + 1) % 1440;
        }
        // cout << x[i] << endl;
        cout << (to_string(time/60).size() == 1 ? "0" : "") << time / 60 << ":" << (to_string(time%60).size() == 1 ? "0" : "") << time % 60 << endl;
        // assert(x[i] == time);
    }
    // cout << endl << endl;
}


signed main(){
    int N = 1;
    // for(int i = 0; i < 100000; i ++){
    //     init();
        solve();
    // }
    // while(N--)
    return 0;
}