def prime_search(x):
    is_prime = [ True for _ in range(x + 1)]
    is_prime[1] = False
    for p in range(2, N + 1):
        if is_prime[p] == False:
            continue
        for q in range(2 * p, N + 1, p):
            is_prime[q] = False
    primes = list()
    for i in range(1, N + 1):
        if is_prime[i]:
            primes.append(i)
    return primes

N = int(input())
primes = prime_search(N)

result = [ "Lose" ] * (N + 1)

for i in range(N + 1):
    if i == 0 or i == 1:
        result[i] = 'Win'
    if i == 2 or i == 3:
        result[i] = "Lose"
    else:
        for j in range(len(primes)):
            if primes[j] > i:
                break
            else:
                if result[i - primes[j]] == "Lose":
                    result[i] = "Win"
                    break

print(result[N])