#include <algorithm>
#include <cstdio>
using i32 = int;
bool awake_now(i32 time, i32 id) noexcept {
	static char result[25];
	printf("at %02d:%02d check %d\n", time / 60, time % 60, id + 1), fflush(stdout);
	return scanf("%s", result), __builtin_strlen(result) == 5;
}
void report(i32 time) noexcept { printf("%02d:%02d\n", time / 60, time % 60); }
constexpr i32 N = 100;
i32 n, cur[N], len[N];
i32 meet[N], first[N];
i32 ans[N];
signed main() noexcept {
	scanf("%d", &n), std::fill_n(len, n, 48), std::fill_n(meet, n, -1);
	while (true) {
		i32 t = std::min_element(cur, cur + n) - cur;
		if (cur[t] == 114514) break;
		if (~meet[t] && cur[t] == meet[t]) {
			ans[t] = first[t] ? (cur[t] == 1440 ? 720 : cur[t] - 720) : (cur[t] == 1440 ? 0 : cur[t]), cur[t] = 114514;
			continue;
		}
		bool pos = awake_now(cur[t], t);
		if (cur[t] == 0)
			first[t] = pos, cur[t] += len[t]--;
		else {
			if (first[t]) {
				if (pos)
					~meet[t] ? (ans[t] = cur[t] - 720, cur[t] = 114514) : (cur[t] += len[t]--);
				else if (~meet[t]) {
					if (++cur[t] == 1440) ans[t] = cur[t] - 720, cur[t] = 114514;
				} else
					meet[t] = cur[t] + 720, cur[t] -= ++len[t], cur[t] += 720;
			} else {
				if (pos) {
					if (~meet[t]) {
						if (++cur[t] == 1440) ans[t] = 0, cur[t] = 114514;
					} else
						meet[t] = cur[t] + 720, cur[t] -= ++len[t], cur[t] += 720;
				} else
					~meet[t] ? (ans[t] = cur[t], cur[t] = 114514) : (cur[t] += len[t]--);
			}
		}
	}
	puts("answer");
	for (i32 i = 0; i < n; ++i) report(ans[i]);
	return 0;
}