#include <cstdio>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>

using i64 = long long;

const int N = 105;

int n;
int ans[N], lst[N];
int sum[N];

std::vector<int> TurnTime(const int & minutes) {
	std::vector<int> t {minutes / 60, minutes % 60};
	return t;
}

bool query(std::vector<int> t, int id){
	printf("at ");
	printf("%02d:%02d", t[0], t[1]);
	printf(" check %d\n", id);
	std::fflush(stdout);

	char op[10];
	scanf("%s", op + 1);

	return op[2] == 'w';
}

struct Node {
	int id, Time;
	Node(int _id = 0, int _t = 0) : id(_id), Time(_t) {}
	bool operator < (const Node & x) const {
		return Time > x.Time;
	}
};

int main() {
	scanf("%d", &n);

	std::priority_queue<Node> q;
	for (int i = 1; i <= n; i++) {
		sum[i] = 47;
		lst[i] = -1;
		q.emplace(i, 0);
	}

	while (!q.empty()) {
		int id = q.top().id; 
		int t = q.top().Time;
		q.pop();

		if (lst[id] == -1) {
			lst[id] = query(TurnTime(0), id);
			ans[id] = 0;
			q.emplace(id, sum[id]);
		} else {
			if (ans[id] == 1440){
				ans[id] = 720 * lst[id];
				continue;
			}
			bool awake = query(TurnTime(t), id);
			if (sum[id] == 1) {
				if (lst[id] != awake) {
					ans[id]++;
					q.emplace(id, ans[id]);
				}
				else ans[id] -= 720 * lst[id];
			} else {
				if (lst[id] != awake) {
					ans[id] = (ans[id] + 721), sum[id] = 1;
					q.emplace(id, ans[id]);
				} else {
					ans[id] = t;
					q.emplace(id, t + sum[id]);
					sum[id]--;
				}
			}
		}
	}

	puts("answer");
	for (int i = 1; i <= n; i++) {
		std::vector<int> t = TurnTime(ans[i]);
		printf("%02d:%02d\n", t[0], t[1]);
	}
	return 0;
}