N = int(input())


def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n ** 0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return (i for i in range(n + 1) if is_prime[i])


P = tuple(primes(N))
table = [True] * (N + 1)
table[2], table[3] = False, False
for i in range(4, N + 1):
    tmp = False
    for p in P:
        if i - p < 0:
            break
        if not table[i - p]:
            tmp = True
    table[i] = tmp
print("Win" if table[N] else "Lose")