#include<bits/stdc++.h>
#define p_b push_back
#define m_p make_pair
#define pii pair<int,int>
#define int long long 
#define fi first
#define se second
using namespace std;
inline int rd(){
	int x=0,f=1; char ch=getchar();
	for(;ch<'0'||ch>'9';ch=getchar())if (ch=='-') f=-1;
	for(;ch>='0'&&ch<='9';ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
	return x*f;
}
const int N=105,INF=0x3f3f3f3f3f3f3f3f;
void print(int tim){
	int x=tim/60,y=tim%60;
	if(x<=9) putchar('0');
	cout<<x<<":";
	if(y<=9) putchar('0');
	cout<<y;
}
bool ask(int id,int tim){
	printf("at ");print(tim);printf(" check %lld\n",id);
	fflush(stdout);
	string s;cin>>s;
	if(s.size()==5) return 0;
	return 1;
}
priority_queue<pii,vector<pii>,greater<pii> > q;
int ans[N],query[N],num[N],n,last[N],vis[N];
signed main(){
	n=rd();
	memset(query,-1,sizeof(query));
	memset(vis,-1,sizeof(vis));
	for(int i=1;i<=n;i++) q.push(m_p(0,i)),num[i]=1;
	int id,tim,tag;
	while(!q.empty()){
		id=q.top().second,tim=q.top().first;q.pop();	
		num[id]++;
		tag=ask(id,tim);
		if(vis[id]!=-1){
			if(tag==vis[id]){
				if(tag) ans[id]=tim;
				else ans[id]=(tim+720)%1440;
			}
			else if(tim==1439){
				if(tag)ans[id]=720;
				else ans[id]=0;
			}
			else q.push(m_p(tim+1,id));
		}
		else if(query[id]!=-1&&tag!=query[id]){//找到了
			q.push(m_p(last[id]+1+720,id));
			vis[id]=query[id];
		}
		else{
			if(tim==0)query[id]=tag;
			last[id]=tim;
			q.push(m_p(tim+50-num[id],id));
		}
	}
	puts("answer");
	for(int i=1;i<=n;i++){
		print(ans[i]);
		puts("");
	} 	
	return 0;	
} //awake