// Author: Minghan Ye
// Name: D. Dwarfs' Bedtime
// URL: https://qoj.ac/contest/1696/problem/8784
// ML: 1024MB
// TL: 1000ms
// Time: 24/06/20 21:07

#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "E:/OI/normal/templates/debug.h"
#else
#define dbg(...) (void)0
#define msg(...) (void)0
#endif
#define ll long long
#define PB emplace_back
#define PPB pop_back
#define MP make_pair
#define ALL(Name) Name.begin(),Name.end()
#define PII pair<int,int>
#define VI vector<int>
#define GI greater<int>
#define fi first
#define se second



int main()
{
//	int _;cin>>_;while(_--)

	int n;cin>>n;
	bool a[105],ok[105]={};int ans[105];char s[7];
	priority_queue<PII,vector<PII>,greater<PII> >q;
	for(int i=1;i<=n;i++)
	{
		printf("at 00:00 check %d\n",i);fflush(stdout);
		scanf("%s",s);
		a[i]=s[1]=='s';
	}
	int acc=0;
	for(int i=45;i;i--)
	{
		acc+=i;
		for(int j=1;j<=n;j++)
		{
			if(ok[j])continue;
			if(acc>=720){ok[j]=1,q.emplace(1430,j);continue;}
			printf("at %02d:%02d check %d\n",acc/60,acc%60,j);fflush(stdout);
			scanf("%s",s);
			if((s[1]=='s')!=a[j])ok[j]=1,q.emplace(acc-i+720,j);
		}
	}
	while(!q.empty())
	{
		int ti=q.top().fi,id=q.top().se;q.pop();
		printf("at %02d:%02d check %d\n",ti/60,ti%60,id);fflush(stdout);
		scanf("%s",s);
		if((s[1]=='s')==a[id])ans[id]=a[id]?ti:ti-720;
		else if(ti==1439)ans[id]=a[id]?0:720;
		else q.emplace(ti+1,id);
	}
	puts("answer");
	for(int i=1;i<=n;i++)printf("%02d:%02d\n",ans[i]/60,ans[i]%60);
	fflush(stdout);

	return 0;
}