def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

n = int(input())
sosu = primes(n)
lst = [False,False,True]
hantei = True

if n>3:
    for i in range(3,n+1):
        for j in sosu:
            k = i-j
            if k<0:
                lst.append(True)
                break
            if lst[k]:
                lst.append(False)
                break
        else:
            lst.append(True)
    hantei = lst[n]

print("Lose" if hantei else "Win")