def sieve(n):
    is_prime = [True for _ in range(n+1)]
    is_prime[0] = False
    is_prime[1] = False

    for i in range(2, n+1):
        if not is_prime[i]:
            continue
        for j in range(i*2, n+1, i):
            is_prime[j] = False
    table = [ i-1 for i in range(1, n+1) if is_prime[i-1]] # 素数のリスト
    return table

N = int(input())

prime = sieve(N)
win_lose = [0]*(N+1)
win_lose[0] = win_lose[1] = 1

for i in range(4,N+1):
    for p in prime:
        if win_lose[i-p] == 0:
            win_lose[i] = 1
            break
    else:
        win_lose[i] = 0

if win_lose[N]:
    print("Win")
else:
    print("Lose")