#include <bits/stdc++.h>
using namespace std;
const int DEBUG = 1;
int N;
int A[1 << 17], Answer[1 << 17];
int cl[1 << 17];
int cr[1 << 17];
int Counts[1 << 17];
bool Used[1 << 17];
vector<int> List[1 << 17];
string Base[1 << 17];

// ================================================================ Base Function
string Digit2(int x) {
	if (x < 10) return "0" + to_string(x);
	return to_string(x);
}

string Ask(int idx, int val) {
	val %= 1440;

	// Reigai
	if (val == 0) {
		if (Base[idx] == "awake") return "awake";
		if (Base[idx] == "asleep") return "asleep";
	}
	if (val == 720) {
		if (Base[idx] == "awake") return "asleep";
		if (Base[idx] == "asleep") return "awake";
	}

	// Normal
	if (DEBUG == 1) {
		string str = Digit2(val / 60) + ":" + Digit2(val % 60);
		cout << "at " << str << " check " << idx << endl;
		string r; cin >> r;
		return r;
	}
	if (DEBUG == 2) {
		string str = Digit2(val / 60) + ":" + Digit2(val % 60);
		cout << "at " << str << " check " << idx << endl;
		Counts[idx] += 1;
		if ((val - A[idx] + 1440) % 1440 < 720) return "asleep";
		return "awake";
	}
}

// ================================================================ Main Part
int main() {
	// Step 1. Input
	if (DEBUG == 1) {
		cin >> N;
	}
	else {
		cin >> N;
		for (int i = 1; i <= N; i++) A[i] = i - 1;
	}

	// Step 2. First
	for (int i = 1; i <= N; i++) Base[i] = Ask(i, 0);
	for (int i = 1; i <= 40; i++) {
		cl[i] = cr[i - 1] + 1;
		cr[i] = cr[i - 1] + (41 - i);
		cl[i] = min(720, cl[i]);
		cr[i] = min(720, cr[i]);
	}

	// Step 3. Second
	for (int i = 1; i <= 40; i++) {
		for (int j = 1; j <= N; j++) {
			if (Used[j] == true) continue;
			string str = Ask(j, cr[i]);
			if (str != Base[j]) { Used[j] = true; List[i].push_back(j); }
		}
	}

	// Step 4. Third
	for (int i = 1; i <= N; i++) Used[i] = false;
	for (int i = 1; i <= 40; i++) {
		for (int j = cl[i]; j <= cr[i]; j++) {
			for (int k : List[i]) {
				if (Used[k] == true) continue;
				string str = Ask(k, j + 720);
				if (str == Base[k]) {
					Used[k] = true;
					if (Base[k] == "asleep") Answer[k] = (j + 720) % 1440;
					else Answer[k] = (j + 0) % 1440;
				}
			}
		}
	}

	// Step 5. Output
	cout << "answer" << endl;
	for (int i = 1; i <= N; i++) {
		cout << Digit2(Answer[i] / 60) << ":" << Digit2(Answer[i] % 60) << endl;
	}
	return 0;
}