def primes(n):
    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(2*i, n+1, i):
            is_prime[j] = False
    
    return [i for i in range(n+1) if is_prime[i]]
    
N = int(input())
is_win = [None] * (N+1)
is_win[0] = True
is_win[1] = True

for i in range(2, N+1):
    prime = primes(i)
    for prime_i in prime:
        if not is_win[i-prime_i]:
            is_win[i] = True
            break
    else:
        is_win[i] = False

if is_win[i]:
    print('Win')
else:
    print('Lose')