#include<bits/stdc++.h>
#define ll long long
#define N 105
using namespace std;
ll n,ans[N];
bool ji[N],pan[N];
vector<ll>v[N];
void pt(ll t){ll h,m;
    h=t/60,m=t%60;
    if(h<10)cout<<'0';
    cout<<h<<":";
    if(m<10)cout<<'0';
    cout<<m;
}
bool query(ll i,ll t){
    cout<<"at ";
    pt(t);
    cout<<" check "<<i<<endl;
    string s;
    cin>>s;
    return s=="awake";
}
int main(){ll i,k,j,le=47,jl=0;
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n;
    for(i=1;i<=n;i++)ji[i]=query(i,0);
    for(i=1;le;i++,le--){jl+=le;
        if(jl>=720){
            for(k=1;k<=n;k++)if(!pan[k])v[i].push_back(k);
            break;
        }
        for(k=1;k<=n;k++){
            if(pan[k])continue;
            if(query(k,jl)!=ji[k])pan[k]=true,v[i].push_back(k);
        }
    }
    memset(pan,0,sizeof(pan));
    for(i=1,jl=720,le=47;le;i++,jl+=le,le--){
        for(k=1;k<=le;k++){
            if(jl+k>=1440){
                for(j=1;j<=n;j++){
                    if(!pan[j]){
                        if(ji[j])ans[j]=1440;
                        else ans[j]=0;
                    }
                }
                break;
            }
            for(auto j:v[i]){
                if(pan[j])continue;
                if(query(j,jl+k)==ji[j])pan[j]=true,ans[j]=jl+k;
            }
        }
    }
    cout<<"answer"<<endl;
    for(i=1;i<=n;i++){
        if(ji[i])pt(ans[i]-720);
        else pt(ans[i]);
        cout<<endl;
    }
}