import math

def is_prime(n):
    if n == 1: return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True

n = int(input())
x = [-1] * (n + 1)
x[0], x[1] = 1, 1
for i in range(2, n + 1):
    for j in range(1, n):
        if is_prime(n):            
            if j > i:
                break
            if x[i - j] == -1:
                x[i] = 1
if x[-1] == 1:
    print('Win')
else:
    print('Lose')