#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 105;
const int M = 725;

int n, f[N], g[N], ans[N];

vector <int> vec, t[M];

inline int ask(int p, int k, bool flg) {
	--k;
	if (flg) {
		k += 720;
	}
	cout << "at " << (k / 60) / 10 << (k / 60) % 10 << ":" << (k % 60) / 10 << (k % 60) % 10 << " check " << p << endl;
	string res;
	cin >> res;
	string tmp = (g[p] ? "awake" : "asleep");
	if (flg) {
		return res != tmp;
	}
	return res == tmp;
}

int main() {
	memset(f, 0xff, sizeof(f));
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cout << "at 00:00 check " << i << endl;
		string res;
		cin >> res;
		if (res == "asleep") {
			g[i] = 1;
		}
	}
	vec.emplace_back(1);
	for (int i = 30; i <= 600; i += 30) {
		vec.emplace_back(i);
	}
	for (int i = 624; i <= 720; i += 24) {
		vec.emplace_back(i);
	}
	for (int i = 1; i <= 25; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (f[j] == -1) {
				if (ask(j, vec[i], 0)) {
					f[j] = i;
				}
			}
		}
	}
	for (int i = 1; i <= n; ++i) {
		if (f[i] == -1) {
			ans[i] = 721;
			continue;
		}
		ans[i] = vec[f[i]];
		for (int j = vec[f[i] - 1] + 1; j < vec[f[i]]; ++j) {
			t[j].emplace_back(i);
		}
	}
	for (int i = 1; i <= 720; ++i) {
		for (auto u: t[i]) {
			if (ask(u, i, 1) && ans[u] == vec[f[u]]) {
				ans[u] = i;
			}
		}
	}
	cout << "answer" << endl;
	for (int i = 1; i <= n; ++i) {
		--ans[i];
		if (g[i]) {
			ans[i] = (ans[i] + 720) % 1440;
		}
		cout << (ans[i] / 60) / 10 << (ans[i] / 60) % 10 << ":" << (ans[i] % 60) / 10 << (ans[i] % 60) % 10 << endl;
	}
	return 0;
}