#include<bits/stdc++.h>
#define ll long long
#define x first
#define y second
using namespace std;
const int N=110;
int n;
struct dog{int t,f,nx;}a[N];
priority_queue<pair<int,int> > q;

bool ask(int id,int t){
	if(t/60>9) printf("at %d:",t/60);
	else printf("at 0%d:",t/60);
	t%=60;
	if(t>9) printf("%d check %d\n",t,id);
	else printf("0%d check %d\n",t,id);
	cout.flush();
	string ans;
	cin>>ans;
	return ans[1]=='w';
}

signed main(){
	cin>>n;
	for(int i=1;i<=n;i++) q.push({0,i}),a[i]={0,-1,47};
	while(!q.empty()){
		auto u=q.top();q.pop(),u.x*=-1;
		if(u.x==1440){
			a[u.y].t=720*a[u.y].f;
			continue;
		}
		bool f=ask(u.y,u.x);
		if(!~a[u.y].f){
			a[u.y].f=f;
			a[u.y].t=u.x,q.push({-(u.x+a[u.y].nx),u.y}),a[u.y].nx--;
		}
		else{
			if(a[u.y].f!=f){
				if(u.x-a[u.y].t>=720) u.x++;
				else u.x=a[u.y].t+720;
				q.push({-u.x,u.y});
			}
			else{
				if(u.x-a[u.y].t>=720) a[u.y].t=u.x-(720+(u.x-a[u.y].t==720))*a[u.y].f;
				else a[u.y].t=u.x,q.push({-(u.x+a[u.y].nx),u.y}),a[u.y].nx--;
			}
		}
	}
	printf("answer\n");
	for(int i=1,t;i<=n;i++){
		t=a[i].t;
		if(t/60>9) printf("%d:",t/60);
		else printf("0%d:",t/60);
		t%=60;
		if(t>9) printf("%d\n",t);
		else printf("0%d\n",t);
	}
	return 0;
}