//Shirosaki Hana kawaii
#include<bits/stdc++.h>
using namespace std;
inline int read(){
    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;
} 
struct unit{
	int tim,id,step;
	bool operator >(const unit &t)const{
		if (tim+step==t.tim+t.step) return id>t.id;
		return tim+step>t.tim+t.step;
	}
};
priority_queue<unit,vector<unit>,greater<unit> > q;
int n,tp[105],res[105];
inline int ask(int x,int id){
	printf("at %.2d:%.2d check %d\n",x/60,x%60,id);
	fflush(stdout); string r; cin>>r; return r[1]=='w';
}
inline void out(int x){ printf("%.2d:%.2d\n",x/60,x%60); }
signed main(){
	n=read(); 
	for (int i=1;i<=n;i++)
		tp[i]=ask(0,i),q.push({0,i,48});
	while (!q.empty()){
		unit now=q.top(); q.pop();
		if (now.tim+now.step==1440){ res[now.id]=tp[now.id] ? 720:0; continue; }
		if (now.step==1)
			if (ask(now.tim+now.step,now.id)^tp[now.id]) q.push({now.tim+1,now.id,1});
			else res[now.id]=tp[now.id] ? now.tim-719:now.tim+1;
		else if (ask(now.tim+now.step,now.id)^tp[now.id])
			q.push({now.tim+720,now.id,1});
		else q.push({now.tim+now.step,now.id,now.step-1});
	}
	printf("answer\n");
	for (int i=1;i<=n;i++) out(res[i]);
	fflush(stdout);
	return 0;
}