from heapq import heappush, heappop
from functools import lru_cache


def fmt(i):
    assert 0 <= i <= 1440
    if i == 1440:
        i = 0
    h = f"0{i // 60}"[-2:]
    m = f"0{i % 60}"[-2:]
    return f"{h}:{m}"


@lru_cache(maxsize=None)
def query(i, t):
    assert 1 <= i <= n
    if t == 1440:
        return query(i, 0)
    cnt[i] += 1
    assert cnt[i] <= 50
    print(f"at {fmt(t)} check {i}")
    return input().startswith("as")


n = int(input())
h = []
for i in range(1, n + 1):
    heappush(h, [0, 47, -1, -1, i])

cnt = [0] * (n + 1)

ans = [0] * n
while h:
    t, w, r, ty, i = heappop(h)
    if w != -1:
        res = query(i, t)
        if ty != -1 and res != ty:
            heappush(h, [t - w + 719, -1, min(t + 720, 1440), res, i])
            ans[i - 1] = t if res else min(t + 720, 1440)
        else:
            heappush(h, [t + w, w - 1, -1, res, i])
    else:
        res = query(i, t)
        if res != ty:
            if not ty:
                ans[i - 1] = t
            else:
                ans[i - 1] = t - 720
        elif t + 1 <= r:
            heappush(h, [t + 1, w, r, ty, i])

print("answer")
for i in ans:
    print(fmt(i))