n = int(input())

from math import floor
from math import sqrt

def isprime(n):
    if n == 1:
        return False
    if n == 2:
        return True
    if n%2 == 0:
        return False
    for i in range(3, floor(sqrt(n))+1, 2):
        if i != n and n%i == 0:
            return False
    return True

def primes(n):
    p = []
    for i in range(n):
        if isprime(i):
            p.append(i)
    return p

ps = primes(n)

d = []
for i in range(n+1):
    d.append(0)

for i in range(4, n+1):
    s = set()
    for p in ps:
        if i - p < 2:
            break
        s.add(d[i-p])

    g = 0
    for j in sorted(s):
        if j != g:
            break
        g += 1

    d[i] = g

print('Win' if d[n] != 0 else 'Lose')