n = int(input())
#引数　n, 返り値nまでの素数をリストで返す
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(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]
p = primes(n+1)
flag = [False for i in range(n+1)]
for i in range(2,n+1):
    if flag[i] == False:
        for j in p:
            if i + j <= n:
                flag[i+j] = True
if flag[-1]:
    print("Win")
else:
    print("Lose")