#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define ff first
#define ss second
#define fs ff
#define sc ss

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){ cerr << "\n"; }
template<class T, class ... U>
void debug(T a, U ... b){ cerr << a << " ", debug(b...); }
template<class T> void pary(T l, T r) {
	while (l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream &operator<<(ostream &o, pair<A, B> p) {
	return o << '(' << p.ff << ',' << p.ss << ')';
}
//#define TEST
string parse(int t){
	int hx=t/60;
	int mx=t%60;
	string h,m;
	if(hx<10){
		h+='0';
	}
	else{
		h+=char(hx/10+'0');
	}
	h+=char(hx%10+'0');
	if(mx<10){
		m+='0';
	}
	else{
		m+=char(mx/10+'0');
	}
	m+=char(mx%10+'0');
	return h+":"+m;
}
#ifdef TEST
vector<int> ss;
#endif
int query(int t,int x){
	x++;
	auto b=parse(t);
	string s="at "+b+" check ";
	cout << s << x << endl;
	string a;
#ifdef TEST
	if((t-ss[x-1]+1440)%1440<720){
		a="as";
	}
	else{
		a="aw";
	}
	debug(a);
#else
	cin >> a;
#endif
	if(a[1]=='s'){
		return 1;
	}
	else{
		return 0;
	}
}
void answer(vector<int>& ans){
	int n=ans.size();
	cout << "answer" << endl;
	for(int i=0;i<n;i++){
		cout << parse(ans[i]) << endl;
	}
#ifdef TEST
	debug("test");
	for(int i=0;i<n;i++){
		debug(ans[i],ss[i]);
	}
#endif
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
#ifdef TEST
	ss.resize(n);
	for(int i=0;i<n;i++){
		cin >> ss[i];
	}
#endif
	set<int> s;
	for(int i=0;i<n;i++){
		s.insert(i);
	}
	int nw=0;
	vector<int> g(n);
	vector<pii> tmp(n);
	const int p=720;
	for(int i=0;i<n;i++){
		g[i]=query(0,i);
	}
	int w=48;
	while(1){
		int x=min(nw+w,p);
		vector<int> del;
		for(auto h:s){
			auto u=query(x,h);
			if(u!=g[h]){
				tmp[h]=pii(nw,x-1);
				del.push_back(h);
			}
		}
		for(auto h:del){
			s.erase(h);
		}
		nw+=w;
		w--;
		if(x==p){
			break;
		}
	}
	pary(iter(tmp));
	vector<pii> ask;
	for(int i=0;i<n;i++){
		for(int j=tmp[i].fs;j<=tmp[i].sc;j++){
			ask.push_back(pii(j+p,i));
		}
	}
	sort(ask.begin(),ask.end());
	//pary(iter(ask));
	vector<int> ans(n,-1);
	for(auto h:ask){
		if(ans[h.sc]!=-1){
			continue;
		}
		auto a=query(h.fs,h.sc);
		if(a==g[h.sc]){
			if(g[h.sc]==0){
				ans[h.sc]=h.fs-p;
			}
			else{
				ans[h.sc]=h.fs;
			}
		}
	}
	for(int i=0;i<n;i++){
		if(ans[i]==-1){
			int q=(tmp[i].sc+1)%1440;
			if(g[i]==1){
				q+=720;
				q%=1440;
			}
			ans[i]=q;
		}
	}
	answer(ans);
}