#!/usr/bin/python

def sieve(n):
    is_prime = [0, 0] + [1] * (n-1)
    sq = int(n ** .5)
    for i in xrange(2, sq+1):
        if is_prime[i]:
            for j in xrange(i*i, n+1, i):
                is_prime[j] = 0
    return [i for i, p in enumerate(is_prime) if p]

N = int(raw_input())
primes = sieve(N)
win = [1] * 2 + [0] * N
for i in xrange(2, N+1):
    for p in primes:
        if p > i:
            break
        if not win[i-p]:
            win[i] = 1
            break
print 'Win' if win[N] else 'Lose'