def sieve(n):
    res = [True for _ in range(n + 1)]
    res[0] = False
    res[1] = False
    i = 2
    while i * i <= n:
        if res[i]:
            for j in range(i * 2, n + 1, i):
                res[j] = False
        i += 1
    return res

N = int(input())

is_prime = sieve(N)
prime = [i for i in range(N + 1) if is_prime[i]]
graph = [[] for _ in range(N + 1)]

for i in range(N + 1):
    for j in range(len(prime)):
        if i - prime[j] < 0:
            break
        graph[i].append(i - prime[j])

dp = [0 for _ in range(N + 1)]
dp[0] = 1
dp[1] = 1

for i in range(2, N + 1):
    for j in graph[i]:
        if not dp[j]:
            dp[i] = 1
            break

print('Win' if dp[N] else 'Lose')