import math

def isprime(x, prime):
    res = True
    sq = math.sqrt(x)
    for i in range(2, len(prime)):
        if prime[i] > sq or prime[i] == 0:
            break
        if x % prime[i] == 0:
            res = False
            break
    return res

n = int(input())

prime = [0] * n
prime[0] = 2
prime[1] = 3
pnum = 2
for x in range(6, n + 1, 6):
    x1 = x - 1
    x2 = x + 1
    if isprime(x1, prime):
        prime[pnum] = x1
        pnum += 1
    if isprime(x2, prime):
        prime[pnum] = x2
        pnum += 1

win = [False] * (2 * n + 1)
los = 2
for i in range(2, n):
    if win[i]:
        continue
    los = i
    for p in prime:
        if p == 0:
            break
        win[p + los] = True

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