#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define db double
#define mpr make_pair
#define pb push_back

const int maxn=111;
int n;
vector<pair<int,int> >v[111];
//0 - asleep    1 - awake
string timetostring(int minute){
    int h=minute/60;
    int m=minute%60;
    stringstream cout;
    if(h<10)cout<<0<<h;
    else cout<<h;
    cout<<":";
    if(m<10)cout<<0<<m;
    else cout<<m;
    string ans;
    cout>>ans;
    return ans;
}
int ask(int minute,int i){
    assert(0<=minute&&minute<1440);
    cout<<"at "<<timetostring(minute)<<" check "<<i<<endl;
    string s;
    cin>>s;
    if(s=="asleep"/*||s=="0"*/)return 0;
    return 1;
}
vector<pair<int,int> >qry[1555];
int from[111];
int hamu[111];
void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        v[i].pb(mpr(0,ask(0,i)));
        qry[47].pb(mpr(i,46));
    }
    for(int t=0;t<720;t++){
        for(auto p:qry[t]){
            int i=p.fi;
            int step=p.se;
            int res=ask(t,i);
            if(res!=v[i][0].se){
                ;
            }
            else{
                from[i]=t;
                if(t+step<720){
                    qry[t+step].pb(mpr(i,step-1));
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        qry[from[i]+720].pb(mpr(i,1));
    }
    for(int t=720;t<1440;t++){
        for(auto p:qry[t]){
            int i=p.fi;
            int res=ask(t,i);
            if(res==v[i][0].se){
                ;
            }
            else{
                hamu[i]=t;
                if(t+1<1440){
                    qry[t+1].pb(mpr(i,1));
                }
            }
        }
    }
    cout<<"answer\n";
    for(int i=1;i<=n;i++){
        if(v[i][0].se==0)cout<<timetostring((hamu[i]+1)%1440)<<"\n";
        else cout<<timetostring((hamu[i]+1+720)%1440)<<"\n";
    }
    return;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
    return 0;
}