def sieve(n):
    res = []
    is_prime = [True] * (n + 1)
    
    for i in xrange(2, n + 1):
        if is_prime[i]:
            res.append(i)

            for j in xrange(i * i, n + 1, i):
                is_prime[j] = False

    return res

n = input()
primes = sieve(n)
win = [False] * (n + 1)
win[0] = win[1] = True

for i in xrange(2, n + 1):
    for p in primes:
        if p > i:
            break

        if not win[i - p]:
            win[i] = True
            break;

print 'Win' if win[n] else 'Lose'