#include <bits/stdc++.h>
using namespace std;
#define int long long
int st[101],n;
int ans[101];
priority_queue <array<int,3>> qu;
string s;
string prin(int x){
    string num="";
    while(num.size()<2){
        num+=(x%10)+48;
        x/=10;
    }
    reverse(num.begin(),num.end());
    return num;
}
void ask(int tm,int index){
    cout<<"at "<<prin(tm/60)<<":"<<prin(tm%60)<<" check "<<index<<endl<<flush;
    return;
}
void process(){
    while(!qu.empty()){
        auto [tm,t,index]=qu.top();
        qu.pop();
        tm*=-1;
        ask(tm,index);
        cin>>s;
        int val;
        if(s=="asleep") val=1;
        else val=0;
        if(tm==719ll&&val==st[index]){
            if(st[index]==0) ans[index]=720;
            else ans[index]=0;
            continue;
        }
        if(t==1){
            if(val!=st[index]) qu.push({(tm-25+12*60)*-1,2,index});
            else if(tm==598) qu.push({min(719ll,(tm+11))*-1,3,index});
            else qu.push({min(719ll,(tm+26))*-1,1,index});
        }
        if(t==3){
            if(val!=st[index]) qu.push({(tm-10+12*60)*-1,2,index});
            else qu.push({min(719ll,(tm+11))*-1,3,index});
        }
        if(t==2){
            if(val==st[index]){
                if(st[index]==1) ans[index]=tm;
                else ans[index]=tm+12*60;
            }
            else qu.push({(tm+1)*-1,2,index});
        }
    }
}
//20:00 -> 7:59 
//1:41 -> 13:40 
void find(){
    for(int i=1;i<=n;i++){
        ask(0,i);
        cin>>s;
        if(s=="asleep") st[i]=1;
        else st[i]=0;
        qu.push({26ll*-1,1ll,i});
    }
    process();
    return;
}
signed main()
{
    cin>>n;
    find();
    cout<<"answer"<<endl<<flush;
    for(int i=1;i<=n;i++) cout<<prin((ans[i]/60)%24)<<":"<<prin(ans[i]%60)<<endl<<flush;
    return 0;
}