#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif
 
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) {bool f = true; os << "["; for (const auto &x : c) {if (!f) os << ", "; f = false; os << x;} return os << "]";}
template<typename T> void debug(string s, T x) {cerr << "\033[1;35m" << s << "\033[0;32m = \033[33m" << x << "\033[0m\n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << "\033[1;35m" << s.substr(0, i) << "\033[0;32m = \033[33m" << x << "\033[31m | "; debug(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}

typedef int int2;
#define int long long
#define pi pair<int, int>
#define vi vector<int>
#define vii vector<vector<int>>
#define vpi vector<pi>
#define lep(i,l,r) for(int i=l;i<=r;++i)
#define rep(i,r,l) for(int i=r;i>=l;--i)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define f first
#define s second
const int inf = 1e18;

int t;

string get_string(int x) {
    string S = to_string(x);
    if ((int)S.size() < 2) S = "0" + S;
    return S;
}

int chk(int h, int m, int i, int flag = 1) {
    string hs = get_string(h);
    string ms = get_string(m);
    cout << "at " << hs << ":" << ms << " check " << i << endl;
    string st;
    cin >> st;
    int ans;
    if (st == "asleep") ans = 1;
    else ans = 0;
    if (!flag) {
        ans = 1 - ans;
    }
    return ans;
}


int2 main() {
    int n;
    cin >> n;
    int nm = 1600;    

    // event will be of form (i, stepsize) (stepsize is -1 if hopping by ones)
    pi deft = {inf,inf};
    vector<pi> ans(n+1, deft);
    vector<vector<pi>> events(nm);
    vector<bool> asleep(n+1);
    for (int i = 1; i <= n; i++) {
        asleep[i] = chk(0,0,i);
    }
    for (int i = 1; i <= n; i++) {
        events[48].pb({i, 48});
    }

    int half_day = 720;
    for (int t = 0; t < 1440; t++) {
        for (auto [i, val]: events[t]) {
            int h = t / 60;
            int m = t % 60;
            int res = chk(h, m, i);
            // cout << "res: " << res << ", val: " << val
            DEBUG(i,res,val,asleep[i]);
            // DEBUG(res,val);
            if (val == -1 and res == asleep[i]) {
                if (res == 1) {
                    ans[i] = {h,m};
                } else {
                    ans[i] = {h-12, m};
                }
            }
            if (val == -1 and res != asleep[i]) {
                events[t+1].pb({i,-1});
            }
            if (val > 0 and res != asleep[i]) {
                events[t - val + 1 + half_day].pb({i,-1});
            }
            if (val > 0 and res == asleep[i]) { // keep going
                int step_size = val - 1;
                events[t + step_size].pb({i, step_size});
            }
        }
    }
    cout << "answer" << endl;
    for (int i = 1; i <= n; i++) {
        if (ans[i].f == inf) {
            if (asleep[i]) ans[i] = {0,0};
            else ans[i] = {12,0};
        }
        cout << get_string(ans[i].f) << ":" << get_string(ans[i].s) << endl;
    }
} 

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/