from heapq import heappush


def intToTime(t):
    h, m = divmod(t, 60)
    return '{}:{}'.format(str(h).zfill(2), str(m).zfill(2))


def query(i, t):
    print('at {} check {}'.format(intToTime(t), i+1))


query_count = 0
N = int(input())
ans = [-1]*N
ans_candidate = [0]*N
queries = [[] for _ in range(1440)]
res_0000 = []
finished = [0]*N

t = 0
for i in range(N):
    query(i, 0)
    res_0000.append(input())

for dt in range(50)[::-1]:
    prev_t = t
    t += dt
    if t >= 720:
        for i in range(N):
            if not finished[i]:
                start = prev_t + 720
                end = 1440
                for to_check in range(start+1, end):
                    queries[to_check].append(i)
                if res_0000[i] == "asleep":
                    ans_candidate[i] = 0
                else:
                    ans_candidate[i] = 720
                finished[i] = 1
    else:
        for i in range(N):
            if not finished[i]:
                query(i, t)
                if input() != res_0000[i]:
                    start = prev_t + 720
                    end = t + 720
                    for to_check in range(start+1, end):
                        queries[to_check].append(i)
                    if res_0000[i] == "asleep":
                        ans_candidate[i] = t + 720
                    else:
                        ans_candidate[i] = t
                    finished[i] = 1

for t in range(720, 1440):
    for i in queries[t]:
        if ans[i] == -1:
            query(i, t)
            if input() == res_0000[i]:
                if res_0000[i] == "asleep":
                    ans[i] = t
                else:
                    ans[i] = t - 720

print("answer")
for i in range(N):
    if ans[i] == -1:
        print(intToTime(ans_candidate[i]))
    else:
        print(intToTime(ans[i]))