def get_primes(n):
    numbers = [True for _ in range(n + 1)]
    numbers[0] = False
    numbers[1] = False
    result = []

    for i in range(2, n + 1):
        if numbers[i]:
            result.append(i)
            for j in range(i * 2, n + 1, i):
                numbers[j] = False

    return result


n = int(input())
primes = get_primes(n)
dp = [False] * (n + 1)
dp[0] = True
dp[1] = True

for i in range(2, n + 1):
    for x in primes:
        if x > i:
            break
        if not dp[i - x]:
            dp[i] = True

if dp[n]:
    print('Win')
else:
    print('Lose')