#ifdef LOCAL
#define _GLIBCXX_DEBUG 1
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

#if 0
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
 
    template<class T>
    using ordered_set = __gnu_pbds::tree<T, __gnu_pbds::null_type, std::less<T>, __gnu_pbds::rb_tree_tag,
        __gnu_pbds::tree_order_statistics_node_update>;
#endif

#include <vector> 
#include <list> 
#include <map> 
#include <set> 
#include <queue>
#include <stack> 
#include <bitset> 
#include <algorithm> 
#include <numeric> 
#include <utility> 
#include <sstream> 
#include <iostream> 
#include <iomanip> 
#include <cstdio> 
#include <cmath> 
#include <cstdlib> 
#include <ctime> 
#include <cstring>
#include <random>
#include <chrono>
#include <cassert>

using namespace std;
 
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)

#define each(a,x) for (auto& a: x)
#define tcT template<class T
#define tcTU tcT, class U
#define tcTUU tcT, class ...U
template<class T> using V = vector<T>; 
template<class T, size_t SZ> using AR = array<T,SZ>;

typedef string str;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
 
template<typename T, typename U> T &ctmax(T &x, const U &y){ return x = max<T>(x, y); }
template<typename T, typename U> T &ctmin(T &x, const U &y){ return x = min<T>(x, y); }
 
mt19937 rng((unsigned)chrono::steady_clock::now().time_since_epoch().count());
 
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(vector<bool> v) { str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) { str res = ""; F0R(i,SZ) res += char('0'+b[i]); return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { bool fst = 1; str res = "{"; for (const auto& x: v) {if (!fst) res += ", ";	fst = 0; res += ts(x);}	res += "}"; return res;}
template<class A, class B> str ts(pair<A,B> p) {return "("+ts(p.first)+", "+ts(p.second)+")"; }
 
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { pr(h); pr(t...); }
void ps() { pr("\n"); }
template<class H, class... T> void ps(const H& h, const T&... t) { pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
 
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {cerr << ts(h); if (sizeof...(t)) cerr << ", ";	DBG(t...); }

tcTU> void re(pair<T,U>& p);
tcT> void re(V<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);

tcT> void re(T& x) { cin >> x; }
void re(double& d) { str t; re(t); d = stod(t); }
void re(long double& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }

tcTU> void re(pair<T,U>& p) { re(p.first,p.second); }
tcT> void re(V<T>& x) { each(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { each(a,x) re(a); }
tcT> void rv(int n, V<T>& x) { x.rsz(n); re(x); }

constexpr bool multitest() {return 0;}
void solve();
void solve_inner(int n);

vi ans;
int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int t = 1;
	if (multitest()) cin >> t;

#ifndef LOCAL
	for (; t; t--) solve();
#else
	for (int i = 0; i < 1440; i++) {
		ans = {i};
		dbg(i);
		solve_inner(1);
	}
#endif
}
















vi cnt;

bool ask(int i, int t) {
	cnt[i]++;
	assert(cnt[i] <= 50);
	cout << "at ";
	cout << std::setfill('0') << std::setw(2) << t/60 << ":" << std::setfill('0') << std::setw(2) << t%60;
	cout << " check " << i+1 << endl;
#ifndef LOCAL
	string s;
	cin >> s;
	return s == "asleep";
#else
	return (ans[i] <= t && t < ans[i]+720) || (ans[i] <= t+1440 && t+1440 < ans[i]+720);
#endif
}

void check(int i, int t) {
	cout << std::setfill('0') << std::setw(2) << t/60 << ":" << std::setfill('0') << std::setw(2) << t%60 << endl;
#ifdef LOCAL
	assert(t == ans[i]);
#endif
}




void solve_inner(int n) {
	cnt = vi(n);

	vector< pii > inter(n);
	vector< vi > state(n, vi(1441,-1));
	for (int i = 0; i < n; i++) {
		state[i][0] = ask(i, 0);
		state[i][720] = !state[i][0];
	}

	int curt = 0;
	int remchecks = 49;
	while (curt < 720) {
		int nxt = min(720, curt+remchecks);
		for (int i = 0; i < n; i++) if (inter[i] == pii{0,0}) {
			state[i][nxt] = ask(i, nxt);
			state[i][nxt+720] = !state[i][nxt];
			if (state[i][nxt] != state[i][curt]) {
				inter[i] = {curt+720, nxt+720};
			}
		}
		curt = nxt;
		remchecks--;
	}

	vi ret(n);

	for (int t = 720; t <= 1440; t++) {
		vi handle;
		for (int i = 0; i < n; i++) if (inter[i].first == t) handle.push_back(i);

		if (!handle.empty()) {
			for (int j = inter[handle.front()].first+1; j < inter[handle.front()].second; j++) {
				for (int x : handle) {
					state[x][j] = ask(x, j);
				}
			}

			for (int x : handle) {
				for (int j = inter[handle.front()].first; j < inter[handle.front()].second; j++) {
					if (state[x][j] != state[x][j+1]) {
						if (state[x][j+1]) ret[x] = j+1;
						else ret[x] = (j+1)-720;
						break;
					}
				}
			}
		}
	}

	ps("answer");
	for (int i = 0; i < n; i++) {
		check(i, ret[i]%1440);
	}
}	

void solve() {
	int n; re(n);
	
	srand(1337);
	ans.clear();
	for (int i = 0; i < n; i++) {
		ans.push_back(rand()%1440);
		dbg(ans[i]);
	}

	solve_inner(n);
}