n = int(input())

dp = set([0,1])
is_primes = set([])
sieve = [1] * 10001

for i in range(2,n+1):
    if sieve[i]:
        is_primes.add(i)
        for j in range(i*2,10001,i):
            sieve[j] = 0

    for k in is_primes:
        if i - k not in dp:
            dp.add(i)
            break

if n in dp:
    print('Win')
else:
    print('Lose')