def is_prime(n):
    i = 2
    while i * i <= n:
        if n % i == 0:
            return False
        i += 1
    return True


n = int(input())
ans = [False] * (n + 1) 
ans[0] = True
ans[1] = True
ans[2] = False

prime_table = []

for i in range(2, n + 1):
    if is_prime(i):
        prime_table.append(i)
for i in range(4, n + 1):
    for j in prime_table:
        if i < j:
            break
        if not(ans[i - j]):
            ans[i] = True
            break

print("Win" if ans[n] else "Lose")