#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void print_time(int time) {
  int hours = time / 60;
  int mins = time % 60;
  cout << hours / 10 << hours % 10 << ':' << mins / 10 << mins % 10;
}

//#define DEBUG

#ifdef DEBUG
vector<int> ans = {20 * 60 + 00, 01 * 60 + 41};
map<int, int> total;
#endif

bool query(int i, int time) {
#ifdef DEBUG
  static int prev_time = 0;
  assert(prev_time <= time);
  ++total[i];
  assert(total[i] <= 50);
  prev_time = time;
  int sleep_from = ans[i];
  int sleep_to = ans[i] + 12 * 60 - 1;
  if (sleep_to < 24 * 60)
    return sleep_from <= time && time <= sleep_to;
  return time <= sleep_to - 24 * 60 || time >= sleep_from;
#else
  cout << "at ";
  print_time(time);
  cout << " check " << i + 1 << endl;
  string s;
  cin >> s;
  return s == "asleep";
#endif
}

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

  int n;
  cin >> n;

#ifdef DEBUG
  ans.resize(n);
  for (int i = 0; i < n; ++i)
    ans[i] = i;
#endif

  vector<bool> start(n, false);
  for (int i = 0; i < n; ++i) {
    start[i] = query(i, 0);
  }
  vector<pair<int, int>> borders(n);
  vector<int> rest;
  for (int i = 0; i < n; ++i)
    rest.emplace_back(i);
  int remaining = 49;
  int cur_time = 0;
  while (!rest.empty()) {
    --remaining;
    int new_time = min(cur_time + remaining, 12 * 60);
    vector<int> new_rest;
    for (int i : rest) {
      if (query(i, new_time) != start[i]) {
        borders[i] = make_pair(cur_time, new_time);
      } else {
        new_rest.emplace_back(i);
      }
    }
    cur_time = new_time;
    swap(rest, new_rest);
  }
  vector<pair<int, int>> order;
  vector<int> ans(n);
  for (int i = 0; i < n; ++i) {
    ans[i] = borders[i].second + 12 * 60;
    for (int j = borders[i].first + 12 * 60 + 1; j < borders[i].second + 12 * 60; ++j)
      order.emplace_back(j, i);
  }
  sort(order.begin(), order.end());
  for (auto [t, i] : order) {
    if (ans[i] < t)
      continue;
    if (query(i, t) == start[i]) {
      ans[i] = t;
    }
  }
  cout << "answer\n";
  for (int i = 0; i < n; ++i) {
    if (ans[i] == 24 * 60)
      ans[i] = 0;
    if (!start[i]) {
      ans[i] = (ans[i] + 12 * 60) % (24 * 60);
    }
    print_time(ans[i]);
    cout << '\n';
  }
  return 0;
}