#include <bits/stdc++.h>

using namespace std;
char s[10];

const int N = 110, M = 1500;
int org[N], ans[N];
vector<pair<int, int>> q[M];

bool query(int num, int id) {
  printf("at %02d:%02d check %d\n", num / 60, num % 60, id);
  fflush(stdout);
  scanf("%s", s);
  return s[1] == 'w';
}

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) org[i] = query(0, i), q[39].emplace_back(i, 38);
  for (int i = 39; i < 1440; i++) {
    for (auto [id, nx] : q[i]) {
      int x = query(i, id);
      if (nx == -1) {
        if (org[id]) { // awake
          if (x == 1) ans[id] = i - 720;
          else q[i + 1].emplace_back(id, -1);
        } else { // asleep
          if (x == 0) ans[id] = i;
          else q[i + 1].emplace_back(id, -1);
        }
        continue;
      }
      if (x == org[id]) q[i + nx].emplace_back(id, nx - 1);
      else q[i + 720 - nx].emplace_back(id, -1);
      
    }
  }
  for (auto [id, nx] : q[1440]) {
    if (org[id]) ans[id] = 720;
  }
  printf("answer\n");
  for (int i = 1; i <= n; i++) printf("%02d:%02d\n", ans[i] / 60, ans[i] % 60);
  fflush(stdout);
  return 0;
}