#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpl = vector<pl>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

const int INFi = 2e9;
const int N = 5e5 + 5;
const ll INF = 2e18;

void print_time(int t) {

    int h = t / 60;
    int m = t % 60;
    cout << h / 10 << h % 10 << ":" << m / 10 << m % 10;
}

bool is_sleep(int ask_time, int i) {
    cout << "at ";
    print_time(ask_time);
    cout << " check " << i + 1 << endl;
    string s;
    cin >> s;
    if (s == "asleep") {
        return true;
    } else {
        return false;
    }
}

void solve() {
    int n;
    cin >> n;
    int q = 49;
    vector<bool> tp(n);
    rep(i, n) tp[i] = is_sleep(0, i);
    vector<int> lq(n, -1), rq(n, -1);
    int tt = 0;
    const int DAY = 1440;

    rep(_, 49) {
        int pt = tt;
        tt += q;
        tt = min(tt, DAY / 2);
        rep(j, n) {
            if (lq[j] == -1) {
                assert(pt < tt);
                bool c = is_sleep(tt, j);
                if (c != tp[j]) {
                    lq[j] = pt + DAY / 2 + 1;
                    rq[j] = tt + DAY / 2;
                }
            }
        }
        q--;
    }

    while (true) {
        int j = -1;
        rep(i, n) {
            assert(lq[i] != -1);
            assert(lq[i] <= rq[i]);
            if (lq[i] < rq[i]) {
                if (j == -1 || lq[i] < lq[j]) j = i;
            }
        }
        if (j == -1) break;
        bool c = is_sleep(lq[j], j);
        if (c != tp[j]) {
            lq[j]++;
            assert(lq[j] <= rq[j]);
        } else {
            rq[j] = lq[j];
        }
    }

    cout << "answer" << endl;
    rep(i, n) {
        int t;
        if (tp[i]) {
            t = lq[i];
        } else {
            t = lq[i] - DAY / 2;
        }
        t %= DAY;
        print_time(t);
        cout << endl;
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << setprecision(15) << fixed;
    int t = 1;
//    cin >> t;
    rep(_, t) {
        solve();
    }

    return 0;
}