n = int(input())
def sieve(n):
    is_prime = [True for _ in range(n+1)]
    is_prime[0] = False

    for i in range(2, n+1):
        if is_prime[i-1]:
            j = 2 * i
            while j <= n:
                is_prime[j-1] = False
                j += i
    table = [ i for i in range(1, n+1) if is_prime[i-1]]
    return is_prime, table

_,primes=sieve(n)

table=[False]*(n+1)

table[0]=True # win
table[1]=True

for num in range(2,n+1):
    for p in primes:
        if p>num:
            break
        if not table[num-p]:
            table[num]=True
if table[-1]:
    print("Win")
else:
    print("Lose")