#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
using pii=pair<int,int>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;
const bool DEB=0;

int n,m=720,in[N],l[N],r[N],po[N],fo[N],an[N],lq,asq[N];

bool ask(int t,int i)
{
	if (t<lq)
	{
		cout<<"asked "<<t<<" after "<<lq<<endl;
		exit(0);
	}
	if (t>=2*m) return 0;
	//cout<<t<<' '<<i<<en;
	++asq[i];
	lq=t;
	if (DEB)
	{
		return (t>=po[i] && t<po[i]+m) || (t+m<po[i]);
	}
	else
	{
		cout<<"at "<<t/600<<(t/60)%10<<":"<<(t/10)%6<<t%10<<" check "<<i+1<<endl;
		string rep;
		cin>>rep;
		return rep=="asleep";
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	if (DEB)
	{
		n=1440;
		for (int i=0;i<n;++i) po[i]=i;
	}
	else
	{
		cin>>n;
	}
	for (int i=0;i<n;++i) in[i]=ask(0,i);
	int cl=0,cr=39;
	for (int i=40;i>=2;--i)
	{
		for (int j=0;j<n;++j) if (r[j]==0 && in[j]!=ask(min(m,cr+1),j))
		{
			l[j]=cl;
			r[j]=min(m-1,cr);
		}
		cl=cr+1;
		cr=cl+i-2;
	}
	cl=0,cr=39;
	for (int i=40;i>=2;--i)
	{
		for (int p=cl;p<=cr;++p) for (int j=0;j<n;++j) if (l[j]==cl && !fo[j])
		{
			if (in[j]==ask(p+m+1,j))
			{
				fo[j]=1;
				an[j]=p+1+(m*in[j]);
			}
		}
		cl=cr+1;
		cr=cl+i-2;
	}
	cout<<"answer"<<endl;
	for (int i=0;i<n;++i)
	{
		//cout<<asq[i]<<' ';
		assert(asq[i]<=42);
		int t=an[i];
		cout<<t/600<<(t/60)%10<<":"<<(t/10)%6<<t%10<<endl;
	}
}