import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


import std.concurrency;

void main() {
  const N = readInt;
  auto dwarfs = new Generator!int[N];
  auto ans = new int[N];
  ans[] = -1;
  foreach (u_; 0 .. N) {
    dwarfs[u_] = new Generator!int((u => () {
      enum M = 1440;
      enum K = 50;
      auto xs = new int[K];
      foreach (i; 1 .. K) {
        xs[i] = xs[i - 1] + (K - i);
      }
      int ini;
      int ask(int x) {
        if (x >= M) return ini;
        yield(x);
        writefln("at %02d:%02d check %s", x / 60, x % 60, u + 1);
        stdout.flush;
        const res = readToken;
        return (res == "asleep") ? 1 : 0;
      }
      ini = ask(xs[0]);
      foreach (i; 1 .. K) {
        if (ini != ask(xs[i])) {
          // (xs[i-1], xs[i]]
          foreach (x; xs[i - 1] + 1 .. xs[i] + 1) {
            if (x == xs[i] || ini != (1 ^ ask(x + M/2))) {
              ans[u] = (ini ? (x + M/2) : x) % M;
              return;
            }
          }
        }
      }
    })(u_));
  }
  for (; ; ) {
    int mn = int.max;
    int um = -1;
    foreach (u; 0 .. N) if (!dwarfs[u].empty) {
      if (chmin(mn, dwarfs[u].front)) {
        um = u;
      }
    }
    if (!~um) break;
    dwarfs[um].popFront;
  }
  writeln("answer");
  foreach (u; 0 .. N) {
    writefln("%02d:%02d", ans[u] / 60, ans[u] % 60);
  }
  stdout.flush;
}