#include<bits/stdc++.h>
#include <string>
using namespace std;
mt19937 rnd(random_device{}());
int gen(int l,int r)
{
	return rnd()%(r-l+1)+l;
}
const int B=27;
bool vis[1445];
int cnt[105],ans[105],us[105],r[105];
vector<int> v1,v2,st[3445],ed[3445];
string totime(int x)
{
	string t1=to_string(x/60),t2=to_string(x%60);
	if(t1.size()==1) t1="0"+t1;
	if(t2.size()==1) t2="0"+t2;
	return t1+":"+t2;
}
bool query(int x,int y)
{
	cnt[y]++;
	if(cnt[y]>50)
	{
		cout<<"QAQ,I can't solve the problem!"<<endl;
		exit(0);
	}
	cout<<"at "<<totime(x)<<" "<<"check"<<" "<<y<<endl;
	string t;
	cin>>t;
	if(t[1]=='w') return 0;
	else return 1;
}
int main()
{
	for(int i=0,j=0;i<1440;j++)
	{
		i+=max(49-j,27);
		// if(j>=50) break ;
		if(i>=1440) break ;
		vis[i]=1;
	}
	int n;
	cin>>n;
	int lst=0;
	for(int i=1;i<=n;i++)
	{
		int f=query(0,i);
		if(f) v2.emplace_back(i);
		else v1.emplace_back(i);
	}
	for(int i=1;i<1440;i++)
	{
		for(auto j:st[i])
		{
			if(i==r[j]||query(i,j)) ans[j]=i;
			else st[i+1].emplace_back(j);
		}
		for(auto j:ed[i])
		{
			if(i==r[j]||!query(i,j)) ans[j]=i-720;
			else ed[i+1].emplace_back(j);
		}
		if(vis[i])
		{
			for(auto j:v1)
			{
				if(us[j]) continue ;
				if(query(i,j)) ed[lst+721].emplace_back(j),us[j]=1,r[j]=i+720;
			}
			for(auto j:v2)
			{
				if(us[j]) continue ;
				if(!query(i,j)) st[lst+721].emplace_back(j),us[j]=1,r[j]=i+720;
			}
			lst=i;
		}
	}
	for(auto j:st[1440]) ans[j]=0;
	for(auto j:ed[1440]) ans[j]=720;
	cout<<"answer"<<endl;
	for(int i=1;i<=n;i++)
	{
		cout<<totime(ans[i])<<endl;
	}
}