def primes(N):
    ps = []
    for i in range(3, N, 2):
        for p in ps:
            if i % p == 0:
                break
            else:
                continue
        else:
            ps.append(i)
    ps.insert(0, 2)
    return ps

def game(N, ps):
    won = set([0,1])
    lost = set()
    for n in range(2, N+1):
        for p in ps:
            n_ = n - p
            if n_ < 0:
                lost.add(n)
                break
            elif n_ in lost:
                won.add(n)
                break
            elif n_ in won:
                continue
        else:
            lost.add(n)
    if N in won:
        return 'Win'
    elif N in lost:
        return 'Lose'
    else:
        return 'Kill me'

def main():
    N = int(input())
    ps = primes(N)
    print(game(N, ps))

main()