#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
using ll = long long;
#define all(p) p.begin(),p.end()

template<class T> bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}

template<class T> bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}


int main(){
    int N;
    cin >> N;
    auto f = [&](int a) -> string {
        string res;
        res += (char)((a / 10) + '0');
        res += (char)((a % 10) + '0');
        return res;
    };
    auto cl = [&] (int a) -> string {
        a %= 1440;
        return f(a / 60) + ":" + f(a % 60);
    };
    auto ask = [&](int M, int ind) -> int {
        cout << "at " << cl(M) << " check " << ind + 1 << endl;
        string S;
        cin >> S;
        return (S[1] == 'w' ? 1 : 0);
    };
    vector<int> p(N);
    vector<int> L(N), R(N, -1);
    int tmp = 49;
    int V = 0;
    rep(i, 0, N){
        p[i] = ask(0, i);
    }
    while (V != 720){
        V += tmp;
        chmin(V, 720);
        rep(i, 0, N){
            if (R[i] != -1) continue;
            if (p[i] != ask(V, i)) {
                R[i] = V;
            } else {
                L[i] = V;
            }
        }
        tmp--;
    }
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
    rep(i, 0, N){
        pq.push({L[i], i});
    }
    while(!pq.empty()){
        int t, n;
        tie(t, n) = pq.top();
        pq.pop();
        if (L[n] + 1 == R[n]) continue;
        if (ask(L[n] + 1 + 720, n) == p[n]){
            R[n] = L[n] + 1;
        }
        else {
            L[n]++;
            pq.push({L[n], n});
        }
    }
    cout << "answer" << endl;
    rep(i, 0, N){
        if (p[i]) cout << cl(R[i]) << endl;
        else cout << cl(R[i] + 720) << endl;
    }
}