def is_prime(x):
    for i in range(2, x):
        if x % i == 0:
            return False
    return True

primes = [x for x in range(2, 1000) if is_prime(x)]
memo = [1, 1, 0, 0] + [-1] * 1000


def f(x):
    if memo[x] >= 0:
        return memo[x]
    for i in primes:
        if i > x:
            break
        if f(x - i) == 0:
            memo[x] = 1
            return 1
    memo[x] = 0
    return 0

N = input()
ans = 'Win'
if f(N) == 0:
    ans = 'Lose'
print(ans)