// MagicDark
#include <bits/stdc++.h>
#define tm sdfjhdskjf
#define debug cerr << "\033[32m[" << __LINE__ << "]\033[0m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
mt19937 mrand(20071211);//chrono::steady_clock::now().time_since_epoch().count());
inline int rnd(int l, int r) {return mrand() % (r - l + 1) + l;}
const int T = 1440, N = 1510;
int n, tm[N];
string bot(int x) {
	assert(x >= 0 && x < T);
	string w = "";
	int t = x / 60;
	string g = to_string(t);
	if (g.size() == 1) g = '0' + g;
	w += g;
	w += ':';
	t = x % 60;
	g = to_string(t);
	if (g.size() == 1) g = '0' + g;
	w += g;
	return w;
}
int cnt[N];
int query(int x, int y) {
	// debug << "! " << x << endl;
	cout << "at " << bot(x) << " check " << y << endl;
	// if (++cnt[y] > 50) {
	// 	debug << x << endl;
	// 	exit(0);
	// }
	assert(++cnt[y] <= 50);
	// return (x - tm[y] + T) % T < T / 2;
	string st;
	cin >> st;
	return st == "asleep";
}
int ans[N], num[N];
bool t[N];
set <int> w[2010];
signed main() {
	// F(i, 1, 1440) tm[i] = i - 1;
	tm[1] = 20 * 60;
	// F(i, 1, 100) {
	// 	tm[i] = rnd(0, 1439);
	// 	cout << i << " " << tm[i] << endl;
	// }
	// tm[1] = 1439;
	// tm[1] = 0;
	cin >> n;
	set <int> g, h;
	F(i, 1, n) {
		t[i] = query(0, i);
		g.insert(i);
	}
	int l = 47, s = 0;
	F(i, 1, 1440) {
		if (i == s + l) {
			auto gg = g;
			for (int j: gg) {
				if (query(i, j) != t[j]) {
					// debug << s << " " << j << endl;
					w[s + 720].insert(j);
					g.erase(j);
				}
			}
			s = i;
			l--;
		}
		for (int j: w[i]) h.insert(j);
		auto hh = h;
		if (i == 1440) {
			for (int j: hh) {
				// debug << j << endl;
				if (t[j]) num[j] = 0;
				else num[j] = 1440;
			}
			break;
		}
		for (int j: hh) {
			if (query(i, j) == t[j]) {
				num[j] = i;
				h.erase(j);
			}
		}
	}
	cout << "answer" << endl;
	F(i, 1, n) {
		int w = 0;
		if (t[i]) w = num[i], cout << bot(num[i]) << endl;
		else {
			// debug << i << " " << num[i] << endl;
			assert(num[i] >= 720);
			w = num[i] - 720;
			cout << bot(num[i] - 720) << endl;
		}
		// assert(w == i - 1);
	}
	return 0;
}
/* why?
*/