prime = []
def setPrime(n):
    n += 1
    alive = [True] * n
    i = 2
    while i < n:
        if alive[i]:
            prime.append(i)
            j = 2 * i
            while j < n:
                alive[j] = False
                j += i
        i += 1


def dfs(n):
    if memo[n] != None:
        return memo[n]

    ret = False
    for p in prime:
        if n - p < 0:
            break
        ret |= not dfs(n - p)

    memo[n] = ret
    return ret


N = int(input())
setPrime(N)
memo = [None] * (N + 1)
memo[0] = memo[1] = True
if dfs(N):
    print("Win")
else:
    print("Lose")