#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cerr << #x << ": " << x << el
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

void inc(ll &a, ll b) {
    a += b;
    if (a >= mod) a -= mod;
}
void dec(ll &a, ll b) {
    a -= b;
    if (a < 0) a += mod;
}
ll add(ll a, ll b) {
    a += b;
    return a >= mod ? a - mod : a;
}
ll del(ll a, ll b) {
    a -= b;
    return a < 0 ? a + mod : a;
}
ll qmi(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}
ll inv(ll a) {
    return qmi(a, mod - 2);
}

struct Comb {
    vector<ll> fac, ifac;
    Comb(int n) : fac(n + 1), ifac(n + 1) {
        fac[0] = 1;
        for (int i = 1; i <= n; ++i) fac[i] = fac[i - 1] * i % mod;
        ifac[n] = inv(fac[n]);
        for (int i = n; i; --i) ifac[i - 1] = ifac[i] * i % mod;
    }
    ll binom(int a, int b) {
        return fac[a] * ifac[b] % mod * ifac[a - b] % mod;
    }
};

string get(int x) {
    return format("{:02}:{:02}", x / 60, x % 60);
}

int ask(int x, int i) {
    static int lst = 0;
    assert(x >= lst);
    lst = x;
    cout << format("at {} check {}", get(x), i) << endl;
    string s; cin >> s;
    return s == "awake";
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    vector<int> ans(n + 1), o(n + 1), cont(n + 1);
    vector<vector<int>> vec(n + 1, {0});
    for (int i = 1; i <= n; ++i) o[i] = ask(0, i);
    vector<pii> qry;
    for (int i = 49, j = 49; i != 720; i += --j) {
        if (i > 720) i = 720;
        for (int k = 1; k <= n; ++k) {
            if (cont[k]) continue;
            if (i == 720 || ask(i, k) != o[k]) {
                for (int x = vec[k].back() + 1; x < i; ++x) qry.emplace_back(x + 720, k);
                ans[k] = i + 720;
                cont[k] = 1;
            }
            vec[k].emplace_back(i);
        }
    }
    sort(qry.begin(), qry.end());
    cont = vector<int>(n + 1, 0);
    for (auto[x, y]: qry) {
        if (cont[y]) continue;
        if (ask(x, y) == o[y]) {
            ans[y] = x;
            cont[y] = 1;
        }
    }
    for (int i = 1; i <= n; ++i) if (o[i]) ans[i] += 720;
    cout << "answer" << endl;
    for (int i = 1; i <= n; ++i) cout << get(ans[i] % 1440) << endl;
}