#include <bits/stdc++.h>
using namespace std;
const int maxn = 105, T = 1440;
int n, ans[maxn], sum[maxn], blo[maxn], st[maxn], mk[T], cnt[maxn];
char s[maxn];
const int sz[20] = {0,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,9};
int getresp(){
	scanf("%s", s+1);
	int x = strlen(s+1);
	return s[2]!='w';
}
struct Node{
	int tm, id, sta;
	bool operator < (const Node &t) const{
		return tm == t.tm ? id > t.id : tm > t.tm;
	}
}; priority_queue<Node> q;
void proc(int L,int R,int id){
	for(int i = L + 1; i <= R && i < T; i++) q.push((Node){i, id, 2});
}
int main(){
	scanf("%d",&n);
	for(int i = 1; i <= 19; i++) sum[i] = sum[i - 1] + sz[i], mk[sum[i]] = i;
//	printf("test sum[18] %d\n",sum[18]);
	memset(blo, -1, sizeof(blo));
	memset(ans, -1, sizeof(ans));
	for(int i = 1; i <= n; i++){
		printf("at 00:00 check %d\n",i); fflush(stdout);
		++cnt[i];
		st[i] = getresp();
		for(int j = 1; j <= 19; j++) q.push((Node){sum[j], i, 1});
	}
	while(!q.empty()){
		Node now = q.top(); q.pop();
		int id = now.id;
		int tm = now.tm;
		if(ans[id] != -1) continue;
		else if(blo[id] != -1){
			if(now.sta == 1) continue;
			else if(now.sta == 2){
				printf("at %02d:%02d check %d\n",tm / 60, tm % 60, id); fflush(stdout);
				++cnt[id];
				int cur = getresp();
				if(!st[id] && !cur) ans[id] = (tm + T/2) % T;
				else if(st[id] && cur) ans[id] = tm;
			}
		}
		else{
			printf("at %02d:%02d check %d\n", tm / 60, tm % 60, id); fflush(stdout);
			++cnt[id];
			int cur = getresp();
			if(cur != st[id]){
				blo[id] = mk[tm];
				proc(sum[blo[id] - 1] + T/2, sum[blo[id]] + T/2, id);
			}
		}
	}
	printf("answer\n");
	for(int i = 1; i <= n; i++){
		if(ans[i] == -1) ans[i] = (st[i] ? 0 : 720);
		printf("%02d:%02d\n", ans[i] / 60, ans[i] % 60);
	}
	fflush(stdout);
	return 0;
}