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

const int MAXT(1440), MAXN(1e2 + 5);

int n, cnt;
bool awake0[MAXN];
int ans[MAXN];
vector<int> q[MAXT];

bool is_awake(int t, int id) {
	cnt++;
	printf("at %02d:%02d check %d\n", t / 60, t % 60, id);
	fflush(stdout);
	char res[16];
	scanf("%s", res);
	return res[1] == 'w';
}

int pret(int t) {
	if (t > 320) return t - 20;
	else return t - 40;
}

int nxtt(int t) {
	if (t < 320) return t + 40;
	else return t + 20;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		awake0[i] = is_awake(0, i);
		q[40].emplace_back(i);
	}
	for (int t = 0; t < MAXT; t++) {
		for (int i : q[t]) {
			bool res = is_awake(t, i);
			if (t < 720) {
				if (res != awake0[i]) q[pret(t) + MAXT / 2].emplace_back(i);
				else if (nxtt(t) >= 720) q[t + MAXT / 2].emplace_back(i);
				else q[nxtt(t)].emplace_back(i);
			} else {
				if (res == awake0[i]) ans[i] = t;
				else if (t + 1 == MAXT) ans[i] = 0;
				else q[t + 1].emplace_back(i);
			}
		}
	}
	printf("answer\n");
	for (int i = 1; i <= n; i++) {
		if (awake0[i]) (ans[i] += MAXT / 2) %= MAXT;
		printf("%02d:%02d\n", ans[i] / 60, ans[i] % 60);
	}
	fflush(stdout);
	// cerr << cnt << endl;
	return 0;
}

// (T - 1) + 720 // T

//11:40 23:39

// 36 300