#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 1e7;
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 10010;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN], inv[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
template<typename T> inline void chmax(T &nina, T momoka){ (nina<momoka) ? (nina=momoka) : 0; }
template<typename T> inline void chmin(T &nina, T momoka){ (momoka<nina) ? (nina=momoka) : 0; }
mt19937 rng(486);
inline int myrand(int l, int r){ return (int)(rng() % (r-l+1)) + l; }

void puttime(int t){
	int h = t / 60, m = t % 60;
	//assert(h >= 0 && h < 24 && m >= 0 && m < 60);
	cout << ((h < 10) ? "0" : "") << h << ":";
	cout << ((m < 10) ? "0" : "") << m;
}

int n, lmt[111];
int lst = -1;
int qry(int id, int t){
	assert(t >= lst);
	lst = t;
	--lmt[id];
	if(lmt[id] < 0){
		for(int i = 0; ; i = (i + 1) % n) lmt[i] %= 100;
		for(int i = 0; ; i = (i + 1) % n) lmt[i] += lmt[(i + 1) % n];
	}
	cout << "at ";
	puttime(t);
	cout << " check " << (id+1) << endl;
	string ans;
	cin >> ans;
	return (ans == "asleep") ? 1 : 0;
}

int col[111], ans[111], done[111];
vi qs[1444];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	rep(i, n) lmt[i] = 50;
	rep(i, n) col[i] = qry(i, 0);
	for(int l = 0, d = 46; d > 0; --d){
		int r = l + d;
		rep(i, n) if(!done[i]){
			if(r >= 720 || qry(i, r) != col[i]){
				qs[720 + l + 1].push_back(i);
				done[i] = 1;
			}
		}
		l = r;
	}
	memset(ans, -1, sizeof(ans));
	for(int t = 720; t < 1440; ++t){
		for(auto u : qs[t]){
			if(qry(u, t) == col[u]) ans[u] = (col[u] ? t : (t - 720));
			else qs[t+1].push_back(u);
		}
	}
	cout << "answer" << endl;
	rep(i, n) puttime((ans[i] < 0) ? (col[i] ? 0 : 720) : ans[i]), cout << endl;

	return 0;
}