def is_prime(p):
    i = 2
    while (i * i) <= p:
        if p % i == 0:
            return False
        i += 1
    return True

n = int(input())

primes = [x for x in range(2, n + 1) if is_prime(x)]

dp = [False] * (n + 1)
dp[0] = True
dp[1] = True

for i in range(2, n + 1):
    for j in primes:
        if i - j < 0:
            break
        dp[i] |=  not dp[i - j]

if dp[n]:
    print("Win")
else:
    print("Lose")