#include <bits/stdc++.h>

#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
void print(ll tim){
    ll a=tim/60,b=tim%60;
    if(a<10) co '0';
	co a<<':';
	if(b<10) co '0';
	co b;
}
ll que(ll x,ll tim){
    co "at ";
    print(tim);
    co " check "<<x<<endl;
	string s;
	cin>>s;
	return s=="awake";
}
ll morn[105]={},ans[105]={};
// a[0] = not/found
// a[1] = idx
// a[2] = tries
vector<array<ll,3>>v[2500];
void solve(){
    ll n;
    cin>>n;
    for(int i=1;i<=n;i++){
        morn[i]=que(i,0);
        v[49].push_back({0,i,49});
    }
    for(int i=0;i<1440;i++){
        for(auto [found,idx,tries]:v[i]){
            if(tries==0) ans[idx]=i;
            else if(found==0){
                ll currans=que(idx,i);
                if(morn[idx]!=currans) v[i+721-tries].push_back({1,idx,tries-1});
                else v[i+tries-1].push_back({0,idx,tries-1});
            }
            else{
                ll currans=que(idx,i);
                if(morn[idx]!=currans) v[i+1].push_back({1,idx,tries-1});
                else ans[idx]=i;
            }
        }
    }
    co "answer"<<endl;
    for(int i=1;i<=n;i++){
        if(morn[i]) print((ans[i]+720)%1440);
        else print(ans[i]);
        co endl;
    }
}
int main()
{
    // suiii
    int _=1;
    // cin>>_;
    while(_--) solve();
    return 0;
}