#include<bits/stdc++.h>
using namespace std;
const int MAX_STEP=50,MAX_TIME=1440;

int n,answer[100000];
priority_queue<pair<int,int>> Q;

struct Man{
    int status=1;
    int step=0,now=0;
    int first_result;
    int minn,maxn;
    bool done=false; int answer;

    int next(){
        if(status==1){
            step++,now+=MAX_STEP-step;
            if(step==1)now=0;
            return now;
        }
        else return minn%MAX_TIME;
    }

    void result(int ret){
        if(status==1){
            if(step==1)first_result=ret;
            else if(ret!=first_result){
                status=2;
                minn=now-(MAX_STEP-step)+1+MAX_TIME/2;
                maxn=min(now+MAX_TIME/2,MAX_TIME);
            }
        }
        else{
            if(ret==first_result||minn+1==maxn){
                if(ret!=first_result)minn++;
                done=true,answer=(minn+(!first_result)*MAX_TIME/2)%MAX_TIME;
            }
            else minn++;
        }
    }
}man[100000];

void nextStep(int id){
    int query=man[id].next();
    Q.emplace(-query,id);
}

int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)nextStep(i);
    while(!Q.empty()){
        int query=-Q.top().first;
        int id=Q.top().second;
        Q.pop();
        printf("at %02d:%02d check %d\n",query/60,query%60,id);
        fflush(stdout);
        string s; cin>>s;
        int ret=s=="asleep";
        man[id].result(ret);
        if(man[id].done)answer[id]=man[id].answer;
        else nextStep(id);
    }
    printf("answer\n");
    for(int i=1;i<=n;i++)
        printf("%02d:%02d\n",answer[i]/60,answer[i]%60);
    fflush(stdout);
    return 0;
}