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

const int N=2000;

bool simulate=false;
int goesToBed[N];
int queries[N];
int totalMinutes=1440;
int last=0;

int Ask(int minute,int idx){
    queries[idx]++;
    if(minute<last){
        printf("Decreased time!!!\n");
    }
    last=minute;
    if(simulate){
        int diff=minute-goesToBed[idx];
        if(diff<0)diff+=totalMinutes;
        return diff<totalMinutes/2;
    }else{
        printf("at %02i:%02i check %i\n",minute/60,minute%60,idx);
        fflush(stdout);
        char ans[20];
        scanf("%s",ans);
        return ans[1]=='s';
    }
}

int initial[N];
int go[N],to[N];
bool done[N];
int ans[N];
void Solve(int n){
    for(int i=1;i<=n;i++){
        initial[i]=Ask(0,i);
        go[i]=1;
        to[i]=totalMinutes/2;
        done[i]=false;
    }
    int now=0;
    for(int i=2;i<=50;i++){
        int nxt=now+50-i+1;
        if(nxt>=totalMinutes/2)break;
        for(int i=1;i<=n;i++){
            if(go[i]==now+1){
                if(Ask(nxt,i)==initial[i]){
                    go[i]=nxt+1;
                }else{
                    to[i]=nxt;
                }
            }
        }
        now=nxt;
    }
    //printf("Done first part\n");
    for(int i=0;i<totalMinutes/2;i++){
        for(int j=1;j<=n;j++){
            if(i>=go[j] && i<to[j] && !done[j]){
                if(Ask(i+totalMinutes/2,j)==initial[j]){
                    done[j]=true;
                    ans[j]=i;
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(!done[i])ans[i]=to[i];
        if(initial[i]==1){
            ans[i]=(ans[i]+totalMinutes/2)%totalMinutes;
        }
    }
    if(!simulate){
        printf("answer\n");
        for(int i=1;i<=n;i++){
            printf("%02i:%02i\n",ans[i]/60,ans[i]%60);
        }
    }else{
        for(int i=1;i<=n;i++){
            if(ans[i]!=goesToBed[i])printf("WA %i\n",i);
            if(queries[i]>50)printf("To many queries for %i: %i\n",i,queries[i]);
            printf("%i: %i %i\n",goesToBed[i],ans[i],queries[i]);
        }
    }
}

int main(){
    /*simulate=true;
    for(int i=1;i<=totalMinutes;i++){
        goesToBed[i]=i-1;
    }
    Solve(totalMinutes);*/
    int n;
    scanf("%i",&n);
    Solve(n);
    return 0;
}