#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 110;

int n, a[maxn], b[maxn][maxn];
bool vis[maxn], mk[maxn];
vector<int> vc[1500];

inline int ask(int i, int x) {
	int y = x / 60, z = x % 60;
	printf("at %02d:%02d check %d\n", y, z, i);
	fflush(stdout);
	char s[99];
	scanf("%s", s);
	return s[1] == 's';
}

void solve() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		mk[i] = 1;
	}
	for (int j = 0; j <= 24; ++j) {
		for (int i = 1; i <= n; ++i) {
			if (mk[i]) {
				b[i][j] = ask(i, j * 26);
				if (b[i][j] != b[i][0]) {
					mk[i] = 0;
					a[i] = j * 26;
					for (int k = (j - 1) * 26 + 1 + 720; k < j * 26 + 720; ++k) {
						vc[k].pb(i);
					}
				}
			}
		}
	}
	for (int j = 1, k = 625; j <= 6; ++j, k += 19) {
		for (int i = 1; i <= n; ++i) {
			if (mk[i]) {
				b[i][j] = ask(i, k);
				if (b[i][j] != b[i][0]) {
					a[i] = k;
					mk[i] = 0;
					if (k != 625) {
						for (int p = k - 18 + 720; p < k + 720; ++p) {
							vc[p].pb(i);
						}
					}
				}
			}
		}
	}
	for (int i = 721; i <= 1440; ++i) {
		for (int j : vc[i]) {
			if (vis[j]) {
				continue;
			}
			if (ask(j, i) == b[j][0]) {
				vis[j] = 1;
				a[j] = i - 720;
			}
		}
	}
	puts("answer");
	for (int i = 1; i <= n; ++i) {
		if (b[i][0]) {
			a[i] = (a[i] + 720) % 1440;
		}
		int x = a[i] / 60, y = a[i] % 60;
		printf("%02d:%02d\n", x, y);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}