n = int(input())

sieve = [True] * (n + 1)
primes = []
for p in range(2, n + 1):
    if sieve[p]:
        primes.append(p)
        for i in range(p * p, n + 1, p):
            sieve[i] = False

dp = [True] * (n + 1)
for i in range(2, n + 1):
    ok = False
    for p in primes:
        if p > i:
            break
        if dp[i-p] == False:
            ok = True
            break
    dp[i] = ok
print('Win' if dp[n] else 'Lose')