def eratos(n):
    primes = [True] * (n + 1)
    primes[0] = primes[1] = False

    for i in range(2, int(n ** 0.5) + 1):
        if primes[i]:
            for j in range(i * i, n + 1, i):
                primes[j] = False

    return [i for i in range(2, n + 1) if primes[i]]

n = int(input())
sosu = eratos(n)

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

for i in range(2, n + 1):
    for j in sosu:
        if j > i:
            break
        if not dp[i - j]:
            dp[i] = True
            break

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