#include <bits/stdc++.h>
using namespace std ;
mt19937  rnd(chrono::high_resolution_clock::now().time_since_epoch().count()) ;
long long rand_l_r(long long l , long long r)
{
	uniform_int_distribution<long long> dist(l , r) ;
	return dist(rnd) ;
}
void solve()
{
    int n = 1 ;
    cin >> n ;
    vector<int> a(n) ;
    vector<int> a_lst_one(n , -1) ;
    vector<int> a_lst_zero(n , -1) ;
    vector<int> ban(n , 0) ;
    vector<vector<int>> lst_one(1440) ;
    vector<vector<int>> lst_zero(1440) ;
    vector<int> p ;
    for(int i = 0 ; i < n ; i ++)  p.push_back(i) ;
    vector<int> lst(n , -1) ;
    auto go = [&](int x)
    {
        if(x < 10)  cout << 0 << x ;
        else  cout << x ;
    } ;
    vector<int> x2(n) ;
    for(int i = 0 ; i < n ; i ++)  x2[i] = rand_l_r(0 , 1440 - 1) ;
    auto ask2 = [&](int t , int i)
    {
        if(x2[i] < 720)
        {
            if(t >= x2[i] and t < x2[i] + 720)  return 1 ;
            else  return 0 ;
        }
        else
        {
            if(t >= x2[i] or t < (x2[i] + 720) % 1440)  return 1 ;
            else  return 0 ;
        }
    } ;
    vector<int> cnt(n , 0) ;
    auto ask = [&](int t , int i)
    {
        cnt[i] += 1 ;
        assert(cnt[i] <= 50) ;
        // return ask2(t , i) ;
        // at 01:40 check 1
        cout << "at " ;
        go(t / 60) ;
        cout << ':' ;
        go(t % 60) ;
        cout << " check" ;
        cout << ' ' << i + 1 << endl ;
        string s ;
        cin >> s ;
        if(s[1] == 'w')  return 1 ;
        else  return 0 ;
    } ;
    int now = 0 ;
    int z = 38 ;
    for(int i = 0 ; i < 1440 ; i ++)
    {
        if(i == now)
        {
            vector<int> p2 ;
            for(auto u : p)
            {
                int x = ask(i , u) ;
                if(lst[u] != -1 and lst[u] != x)
                {
                    for(int j = i - (z + 1) + 720 ; j < 1440 ; j ++)
                        if(lst[u] == 0)  lst_one[j].push_back(u) ;
                        else  lst_zero[j].push_back(u) ;
                }
                else  lst[u] = x , p2.push_back(u) ;
            }
            p = p2 ;
            now += z ;
            z -= 1 ;
        }
        for(auto id : lst_one[i])
        {
            if(ban[id] == 1)  continue ;
            int x = ask(i , id) ;
            if(x == 1)  a_lst_one[id] = i ;
            else  assert(a_lst_one[id] != -1) , ban[id] = 1 ;
        }
        for(auto id : lst_zero[i])
        {
            if(ban[id] == 1)  continue ;
            int x = ask(i , id) ;
            if(x == 0)  a_lst_zero[id] = i ;
            else  ban[id] = 1 ;
        }
    }
    for(int i = 0 ; i < n ; i ++)
    {
        if(a_lst_one[i] != -1)
        {
            a[i] = (a_lst_one[i] + 1) % 1440 ;
        }
        else
        {
            // assert(a_lst_zero[i] != -1) ;
            a[i] = (a_lst_zero[i] + 1 + 720) % 1440 ;
        }
    }
    cout << "answer" << endl ;
    for(int i = 0 ; i < n ; i ++)
    {
        go(a[i] / 60) ;
        cout << ':' ;
        go(a[i] % 60) ;
        cout << endl ;
    }
}
int main()
{
    // std::ios::sync_with_stdio(false) , cin.tie(0) ;
    solve() , exit(0) ;
    int T = 0 ;
    while (true)  cout << ++ T << '\n' , solve() ;

    return 0 ;
}