#include<iostream>
#include<vector>
#include<set>
#include<cassert>
using namespace std;
int N;
string st(int n)
{
	string ret;
	ret+=n/10+'0';
	ret+=n%10+'0';
	return ret;
}
int cnt[1441];
int pt=0;
bool awake(int t,int id)
{
	assert(pt<=t&&t<1440);
	pt=t;
	assert(1<=id&&id<=N);
	assert(++cnt[id-1]<=50);
	cout<<"at "<<st(t/60)<<":"<<st(t%60)<<" check "<<id<<endl;
	if(false)
	{
		id--;
		//awake on id
		int l=id,r=id+720;
		if(r<=1440)return !(l<=t&&t<r);
		else return !(l<=t||t<r-1440);
	}
	string s;
	cin>>s;
	return s=="awake";
}
void answer(vector<int>ans)
{
	assert(ans.size()==N);
	cout<<"answer"<<endl;
	for(int t:ans)
	{
		assert(0<=t&&t<1440);
		cout<<st(t/60)<<":"<<st(t%60)<<endl;
	}
	if(false)
	{
		for(int i=0;i<N;i++)if(ans[i]!=i)
		{
			cout<<"WA : on "<<i+1<<" slv = "<<ans[i]<<endl;
		}
		cout<<"END"<<endl;
		return;
	}
}
bool start[1441];
vector<int>Q[1440];
int fn[1441];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	vector<int>dlm;
	{
		dlm.push_back(0);
		int pos=0;
		for(int t=49;t>=1;t--)
		{
			pos+=t;
			if(pos>=720)break;
			dlm.push_back(pos);
		}
		dlm.push_back(720);
	}
	cin>>N;
	//N=1440;
	set<int>S;
	for(int i=1;i<=N;i++)
	{
		S.insert(i);
		start[i]=awake(0,i);
	}
	for(int i=1;i<dlm.size();i++)
	{
		vector<int>OK;
		for(int id:S)
		{
			bool t;
			if(i+1<dlm.size())t=awake(dlm[i],id);
			else t=!start[id];
			if(t!=start[id])
			{
				fn[id]=dlm[i]+720;
				OK.push_back(id);
			}
		}
		for(int id:OK)
		{
			for(int p=dlm[i-1]+1;p<=dlm[i]-1;p++)
			{
				assert(1<=p&&p<720);
				Q[p+720].push_back(id);
			}
			S.erase(id);
		}
	}
	assert(S.empty());
	for(int t=721;t<1440;t++)
	{
		for(int id:Q[t])
		{
			bool f=awake(t,id);
			if(f==start[id])fn[id]=min(fn[id],t);
		}
	}
	vector<int>ans(N);
	for(int i=1;i<=N;i++)
	{
		if(!start[i])ans[i-1]=fn[i]%1440;
		else ans[i-1]=fn[i]-720;
	}
	answer(ans);
}