#include<bits/stdc++.h>
#define ll long long
#define R register
#define PII pair<int,int>
#define mk(x,y) make_pair(x,y)
using namespace std;
const int N=105;
priority_queue<PII,vector<PII>,greater<PII> >q;
inline string to_str(int x){string s="00";s[0]=x/10+'0',s[1]=x%10+'0';return s;}
inline bool ask(int tm,int id){cout<<"at "<<to_str(tm/60)<<':'<<to_str(tm%60)<<" check "<<id<<endl;string s;cin>>s;return s[1]=='s';}
int nw,n,res[N];bool fl[N],a[N];
int main(){
    ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    cin>>n;
    for(R int i=1;i<=n;++i)a[i]=ask(0,i);
    for(R int i=38;i;--i){
        nw+=i;
        for(R int j=1;j<=n;++j){
            if(fl[j])continue;
            if(nw>=720){
                fl[j]=1;q.push(mk(1429,j));continue;
            }
            if(ask(nw,j)^a[j]){fl[j]=1;q.push(mk(nw-i+720,j));}
        }
    }
    for(R int i=1;i<=n;++i)a[i]^=1;
    while(!q.empty()){
        PII tp=q.top();q.pop();
        if(tp.first==1440){res[tp.second]=a[tp.second]?720:0;continue;}
        if(a[tp.second]^ask(tp.first,tp.second))res[tp.second]=a[tp.second]?tp.first-720:tp.first;
        else q.push(mk(tp.first+1,tp.second));
    }
    cout<<"answer"<<endl;
    for(R int i=1;i<=n;++i)cout<<to_str(res[i]/60)<<':'<<to_str(res[i]%60)<<endl;
    return 0;
}