n=int(input())

# nまでの素数を要素にもつ集合を返す関数
def eratosthenes(n):
    primes=set(range(2,n+1))
    for i in range(2,n):
        if i in primes:
            it = i ** 2
            while it <= n:
                if it in primes:
                    primes.remove(it)
                it += i
    return primes

P=sorted(list(eratosthenes(n)))

flag=[-1 for _ in range(n+1)]

flag[0]=1
flag[1]=1

for i in range(2,n+1):
    key=0
    for p in P:
        if p>i:
            break
        if flag[i-p]==0:
            key=1
            break
    flag[i]=key

if flag[n]==1:
    print("Win")
else:
    print("Lose")