// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return b < a ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 105;
const int MAXQ = 50;
const int MOD = 1440;

int n;
bool b[MAXN];
bool fnd[MAXN];
bool done[MAXN];
int ans[MAXN];
vi qry[MOD];

string cvt(int t) {
    char s[20];
    sprintf(s, "%02d:%02d", t / 60, t % 60);
    return string(s);
}
bool ask(int t, int i) {
    cout << "at " << cvt(t) << " check " << i << endl;
    string s; cin >> s;
    return s == "awake";
}

int main() {
    cin >> n;
    REP (i, 1, n + 1) {
        b[i] = ask(0, i);
    }
    int p = 0;
    RREP (g, 49, 1) {
        int pp = p;
        p += g;
        mnto(p, MOD / 2);
        REP (i, 1, n + 1) {
            if (fnd[i]) {
                continue;
            }
            if (b[i] != ask(p, i)) {
                ans[i] = p + MOD / 2;
                REP (j, pp + MOD / 2 + 1, ans[i]) {
                    qry[j].pb(i);
                }
                if (ans[i] == MOD) {
                    ans[i] = 0;
                }
                fnd[i] = 1;
            }
        }
    }
    REP (i, 1, n + 1) {
        assert(fnd[i]);
    }
    REP (p, 0, MOD) {
        for (int i : qry[p]) {
            if (done[i]) {
                continue;
            }
            if (ask(p, i) == b[i]) {
                ans[i] = p;
                done[i] = 1;
            }
        }
    }
    cout << "answer" << endl;
    REP (i, 1, n + 1) {
        if (b[i]) {
            ans[i] += MOD / 2;
            if (ans[i] >= MOD) {
                ans[i] -= MOD;
            }
        }
        cout << cvt(ans[i]) << '\n';
    }
    return 0;
}