#include <bits/stdc++.h>
using namespace std;
int n;
int ph[10011];
int timL[10011],timR[10011],typ[10011];
bool fin[10011];
int lst[10011],lstt[100011];
char s[111];
int res[10011];
int query(int x,int i)
{
	printf("at %02d:%02d check %d\n",x/60,x%60,i);fflush(stdout);
	scanf("%s",s+1);
	if(s[2]=='s')return 1;
	else return 0;
}
const int Day=1440;
int main()
{
	scanf("%d",&n);
	int stp=49,T=0,nxtT=stp;
	for(int i=1;i<=n;++i)
	{
		lst[i]=0;lstt[i]=query(0,i);
	}
	while(T<Day)
	{
		if(T==nxtT)
		{
			for(int j=1;j<=n;++j)if(!ph[j])
			{
				int y=query(T,j);
				if(y!=lstt[j])
				{
					timL[j]=lst[j]+1+Day/2;
					timR[j]=T+Day/2;
					lstt[j]=y;
					typ[j]=y;
					ph[j]=1;
				}
				else lst[j]=T;
			}
			nxtT=min(T+--stp,Day/2);
		}
		for(int j=1;j<=n;++j)if(!fin[j]&&ph[j]&&timL[j]<=T&&T<timR[j])
		{
			int y=query(T,j);
			if(y!=lstt[j])
			{
				res[j]=typ[j]?T-Day/2:T;
				fin[j]=1;
			}
		}
		++T;
	}
	for(int j=1;j<=n;++j)if(!fin[j])res[j]=typ[j]?timR[j]-Day/2:timR[j];
	for(int j=1;j<=n;++j)res[j]%=1440;
	printf("answer\n");
	for(int j=1;j<=n;++j)printf("%02d:%02d\n",res[j]/60,res[j]%60);
	fflush(stdout);
}