#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef __float128 ld;

#define pii pair<int, int>
#define fi first
#define se second
#define VI vector<int>
#define VII vector<vector<int> >

const int N = 500500;
const int inf = 1e9 + 100;
const ll infll = 2e18 + 500;

int query(int u, int t) {
	printf("at %02d:%02d check %d\n", t / 60, t % 60, u);
	fflush(stdout);
	string a;
	cin >> a;
	return a[1] == 's';
}

int St[N], ans[N], nxt[N], prv[N];
queue<int> Q[N];

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

    int n;
    cin >> n;
    for (int i = 0, d = 45; i < 720; d--) {
    	nxt[i] = min(i + d, 720);
    	prv[nxt[i]] = i;
    	i += d;
    }
    for (int i = 720; i < 1440; i++) nxt[i] = i + 1;
    for (int i = 1; i <= n; i++) Q[i].push(0);
    while (1) {
    	int mn = inf, id = 0;
    	for (int i = 1; i <= n; i++) if (!Q[i].empty() && Q[i].front() < mn) {
    		mn = Q[i].front();
    		id = i;
    	}
    	if (mn == inf) break;
    	int t = query(id, mn);
    	Q[id].pop();
    	if (!mn) St[id] = t;
    	if (mn < 720) {
    		if (t == St[id]) {
    			if (nxt[mn] < 720) {
                    Q[id].push(nxt[mn]);
    			}
    			else {
    				Q[id].push(mn + 720);
    			}
    		}
    		else {
    			Q[id].push(prv[mn] + 720);
    		}
    	}
    	else {
    		if (t == St[id]) {
    			ans[id] = St[id] == 0 ? mn - 720 : mn;
    		}
    		else {
    			if (mn == 1439) {
    				ans[id] = St[id] == 0 ? 720 : 0;
    			}
    			else {
    				Q[id].push(nxt[mn]);
    			}
    		}
    	}
    }
    printf("answer\n");
    for (int i = 1; i <= n; i++) {
    	printf("%02d:%02d\n", ans[i] / 60, ans[i] % 60);
    }
    fflush(stdout);

    return 0;
}