def make_prime(f):
    prime_list = []

    prime_list.append(2)
    for i in range(3, f + 1, 2):
        isPrime = True
        j = 2
        while j * j <= i:
            if i % j == 0:
                isPrime = False
                break
            j += 1
        if isPrime:
            prime_list.append(i)
        
    return prime_list;

N = int(input())
ar = make_prime(N)

dp = [0 for i in range(N + 1)]
dp[0] = 1
dp[1] = 1
for i in range(2, N + 1):
    for j in ar:
        if i - j < 0:
            break
        dp[i] |= not dp[i - j]
    
if dp[N] == 1:
    print("Win")
else:
    print("Lose")