def evaluate(s, o):
    o2 = ''
    for c in o:
        if ord('A') <= ord(c) <= ord('Z'):
            idx = ord(c) - ord('A')
            o2 += str(bool((s >> idx) & 1))
        else:
            o2 += c
    return eval(o2)

def solve(n, o):
    n2 = 1 << n
    dp = [{} for _ in range(n2)]
    for s in range(n2):
        dp[n2 - 1][s] = evaluate(s, o)

    for s in range(n2 - 2, -1, -1):
        turn = bin(s).count('1') & 1
        msk = s
        while True:
            dp[s][msk] = turn
            for i in range(n):
                if ((s >> i) & 1) == 0:
                    if dp[s | (1 << i)][msk] != turn or dp[s | (1 << i)][msk | (1 << i)] != turn:
                        dp[s][msk] = 1 - turn
                        break
            if msk == 0:
                break
            msk = (msk - 1) & s
    print("Cook" if dp[0][0] else "Levin")

t = int(input())
for kase in range(t):
    n = int(input())
    s = input()
    solve(n, s)