def isPrime(n):
    """
    素数かどうかを判定する。
    O(√n)
    """

    import math
    m = math.floor(math.sqrt(n))
    for i in range(2,m+1):
        if n%i == 0:
            return False
    return True

N = int(input())
m = 10000 + 1
l = [0 for _ in range(m)]
l[2] = -1
l[3] = -1
l[4] = 1
d = []
for i in range(2,m):
    if isPrime(i):
        d.append(i)

for i in range(2,m):
    if l[i] == 0:
        l[i] = -1
    if l[i] == 1:
        continue
    for j in d:
        if i+j >= m:
            break
        l[i+j] = 1

if l[N] == -1:
    print("Lose")
else:
    print("Win")