#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
#include <cassert>
#include <map>

using namespace std;

int ans[2000], p[2000], c[2000], was[2000], mx = 0;
int XX[2000];

int check(int x, int i) {
    was[i]++;
    mx = max(mx, was[i]);
	int h = x / 60, m = x % 60;
	cout << "at " << h / 10 << h % 10 << ":" << m / 10 << m % 10 << " check " << i << endl;
	string s;
	cin >> s;
	return s == "asleep";
    int X = XX[i];
    if (X + 720 > 1440) {
        if (x >= X || x < X + 720 - 1440) return 1;
        else return 0;
    }
    else {
        if (x >= X && x < X + 720) return 1;
        else return 0;
    }
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
    p[0] = 0;
    for (int i = 1; i <= 100; ++i) {
        p[i] = p[i - 1] + 45 + 1 - i;
        if (p[i] >= 720) {
            p[i] = 720;
            break;
        }
        //cerr << i << " : " << p[i] << '\n';
    }
	int n;
	cin >> n;
    for (int i = 1; i <= n; ++i) {
        XX[i] = i - 1;
    }
    vector<int> was[2];
	for (int i = 1 ; i <= n ; ++ i) {
        if (check(0, i)) {
            was[1].push_back(i);
            c[i] = 1;
        }
        else {
            was[0].push_back(i);
            c[i] = 0;
        }
	}
    vector<int> ask[2][2000];
    for (int i = 1;; ++i) {
        vector<int> saw[2];
        for (int d = 0; d < 2; ++d) {
            for (auto j : was[d]) {
                if (p[i] == 720 || check(p[i], j) == (d^1)) {
                    ask[d][p[i - 1] + 1 + 720].push_back(j);
                }
                else {
                    saw[d].push_back(j);
                }
            }
        }
        was[0] = saw[0];
        was[1] = saw[1];
        if (p[i] == 720) break;
    }
    for (int i = 1; i <= n; ++i)
        ans[i] = -1;
    for (int i = 720; i < 1440; ++i) {
        for (int d = 0; d < 2; ++d) {
            for (auto j : ask[d][i]) {
                if (ans[j] == -1 && check(i, j) == d) {
                    if (d == 0)
                        ans[j] = i - 720;
                    else
                        ans[j] = i;
                }
                ask[d][i + 1].push_back(j);
            }
        }
    }
	cout << "answer" << endl;
	for (int i = 1 ; i <= n ; ++ i) {
		int x = ans[i];
        if (x == -1) {
            x = (c[i] ? 0 : 720);
        }
		int h = x / 60, m = x % 60;
		cout << h / 10 << h % 10 << ":" << m / 10 << m % 10 << endl;
	}
    //cerr << mx << '\n';
}