#include<bits/stdc++.h>
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=100+10;
int query(int tm,int id) {
	cout<<"at ";
	int h=tm/60,m=tm%60;
	if(h<10) cout<<"0"<<h; else cout<<h;
	cout<<":";
	if(m<10) cout<<"0"<<m; else cout<<m;
	cout<<" check "<<id<<endl;
	cout.flush();
	string st; cin>>st;
	if(st=="asleep") return 1;
	return 0;
}
int n,st[MAXN][26],C,ans[MAXN],tp[MAXN];
int ST[MAXN][15],L[MAXN],R[MAXN];
vector<int> _0,_1;
int main() {
	cin>>n,C=24*26;
	ffor(i,0,24) ffor(j,1,n) st[j][i]=query(i*26,j);
	ffor(i,1,n) if(st[i][0]==1) {
		tp[i]=1;
		if(st[i][24]!=1) {
			ffor(j,0,24) if(st[i][j]==0) {L[i]=(j-1)*26+720+1,R[i]=j*26+720;break ;}
		}
		else _1.push_back(i),ST[i][0]=1;
	}
	else {
		if(st[i][24]!=0) {
			ffor(j,0,24) if(st[i][j]==1) {L[i]=(j-1)*26+720+1,R[i]=j*26+720;break ;}
		}
		else _0.push_back(i),ST[i][0]=0;
	}
	ffor(i,1,9) {
		for(auto id:_0) ST[id][i]=query(C+i*10,id);
		for(auto id:_1) ST[id][i]=query(C+i*10,id);	
	}
	for(auto id:_0) {
		ffor(i,1,9) if(ST[id][i]==1) {L[id]=C+(i-1)*10+1+720,R[id]=C+i*10+720;break;}
		if(R[id]==0) L[id]=C+91+720,R[id]=1440;
	}
	for(auto id:_1) {
		ffor(i,1,9) if(ST[id][i]==0) {L[id]=C+(i-1)*10+1+720,R[id]=C+i*10+720;break;}
		if(R[id]==0) L[id]=C+91+720,R[id]=1440;
	}
	ffor(i,1,n) if(tp[i]==1) ans[i]=R[i];
	else ans[i]=R[i]-720;
	ffor(j,720,1440-1) {
		ffor(id,1,n) if(L[id]<=j&&j<R[id]) {
			int st=query(j,id);
			if(st==tp[id]) {
				if(tp[id]==1) ans[id]=min(ans[id],j);
				else ans[id]=min(ans[id],j-720);
			}
		}
	}
	cout<<"answer"<<endl;
	cout.flush();
	ffor(i,1,n) {
		int tm=(ans[i]%1440+1440)%1440;
		int h=tm/60,m=tm%60;	
		if(h<10) cout<<"0"<<h; else cout<<h;
		cout<<":";
		if(m<10) cout<<"0"<<m; else cout<<m;
		cout<<endl;
		cout.flush();
	}
	return 0;
}