#include <bits/stdc++.h>
using namespace std;
#define U(i,l,r) for (int i(l),END##i(r); i<=END##i; ++i)
#define D(i,l,r) for (int i(l),END##i(r); i>=END##i; --i)
#define ms(x, v) memset(x, v, sizeof(x))
#define il __attribute__((always_inline))
#define vc vector
#define ar array
#define pb push_back
#define eb emplace_back
#define el '\n'
using ll = long long;

const int N = 105;
int n;

int ask(int t, int i) {
	printf("at %02d:%02d check %d\n", t / 60, t % 60, i);
	fflush(stdout);
	string s; cin >> s;
	return s[1] == 's';
}
void report(int *t) {
	puts("answer");
	U (i, 1, n)
		printf("%02d:%02d\n", t[i] / 60, t[i] % 60);
	fflush(stdout);
	exit(0);
}

int l[N], r[N];
int last[N] {}, mark[N] {};
int res[N][1440] {};

int main() {
	int t = 0;
	for (int cur = 0; cur <= 719; cur = r[t] + 1, ++t) {
		l[t] = cur; r[t] = min(719, cur + 38 - t);
	}
	U (j, 0, t - 1)
		l[t + j] = l[j] + 720, r[t + j] = r[j] + 720;
	
	// cout << "#" << t << endl;
	ms(mark, -1); ms(res, -1);
	int ans[N]; ms(ans, -1);

	cin >> n;
	U (i, 1, n) {
		res[i][0] = last[i] = ask(0, i);
		res[i][720] = !res[i][0];
	}
	U (j, 1, 2 * t - 1) {
		U (i, 1, n) if (mark[i] == -1) {
			res[i][l[j]] = ask(l[j], i);
			res[i][(l[j] + 720) % 1440] = !res[i][l[j]];
			if (res[i][l[j]] ^ res[i][l[j - 1]])
				mark[i] = j - 1 + t;
		}
		U (k, l[j], r[j]) {
			U (i, 1, n) if (mark[i] == j) {
				res[i][k] = ask(k, i);
				res[i][(k + 720) % 1440] = !res[i][k];
			}
		}
		U (k, l[j], r[j]) U (i, 1, n) if (mark[i] == j) {
			if (res[i][k] && !res[i][(k + 1) % 1440])
				ans[i] = (k + 1 + 720) % 1440;
			else if (!res[i][k] && res[i][(k + 1) % 1440])
				ans[i] = (k + 1) % 1440;
		}
	}
	report(ans);
}