#include<bits/stdc++.h>
using namespace std;

using ll=long long;
using pii=pair<int,int>;
#define sz(a) ((int)a.size())
#define pb push_back
#define all(a) a.begin(),a.end()

const int N=20005,mod=1440;
int ans[N];

string to(int x){
    string res;
    int y=x/60,z=x%60;
    res+='0'+y/10;
    res+='0'+y%10;
    res+=':';
    res+='0'+z/10;
    res+='0'+z%10;
    return res;
}

int lst=0;

int query(int x, int id){
    assert(x>=lst);
    lst=x;
    /*
    {
        int z=(x-ans[id]+mod)%mod;
        if(z<mod/2) return 1;
        return 0;
    }
    */
    cout << "at " << to(x) << " check " << id+1 << endl;
    string s; cin >> s;
    if(sz(s)==6) return 1;
    return 0;
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    ans[0]=0,ans[1]=1439,ans[2]=720,ans[3]=719,ans[4]=1,ans[5]=721,ans[6]=1234,ans[7]=234;
    
    int n; cin >> n;
    vector<int> res(n),f(n),l(n,-1),r(n,-1);
    for(int i=0; i<n; ++i) f[i]=query(0,i);
    int cur=0;
    for(int i=47; i>=1; --i){
        cur+=i;
        cur=min(cur,mod/2);
        bool flag=0;
        for(int j=0; j<n; ++j){
            if(l[j]==-1){
                flag=1;
                if(query(cur,j)!=f[j]){
                    l[j]=cur-i+mod/2,r[j]=cur+mod/2;
                }
            }
        }
        if(!flag) break;
    }
    vector<int> pos(n,mod);
    for(int t=mod/2; t<mod; ++t){
        for(int j=0; j<n; ++j) if(l[j]<=t&&t<=r[j]){
            if(pos[j]!=mod) continue;
            if(query(t,j)==f[j]){
                pos[j]=t;
            }
        }
    }
    for(int i=0; i<n; ++i){
        if(f[i]==1) res[i]=(pos[i])%mod;
        else res[i]=(pos[i]+mod/2)%mod;
        //assert(res[i]==ans[i]);
    }
    cout << "answer" << endl;
    for(int i=0; i<n; ++i) cout << to(res[i]) << endl;
}