import functools

def memoize(obj):
    cache = obj.cache = {}

    @functools.wraps(obj)
    def memoizer(*args, **kwargs):
        if args not in cache:
            cache[args] = obj(*args, **kwargs)
        return cache[args]
    return memoizer


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

@memoize
def win(n):
    if n <= 1:
        return True

    for p in primes:
        if p > n:
            break

        if not win(n - p):
            return True

    return False

n = input()
primes = sieve(n)
print 'Win' if win(n) else 'Lose'