def sieve(n):
    is_prime = [True for _ in range(n+1)]
    is_prime[0] = False

    for i in range(2, n+1):
        if is_prime[i-1]:
            j = 2 * i
            while j <= n:
                is_prime[j-1] = False
                j += i    
    table = [ i for i in range(1, n+1) if is_prime[i-1]]
    return is_prime,table

n = int(input())

MAX = 10001
dp = [0]*(MAX)
dp[0] = dp[1] = 1

is_prime, table = sieve(10005)

for i in range(2,MAX):
  for p in table:
    if is_prime[p]:
      break
    if dp[i-is_prime[p]]==0:
      dp[i] = 1
               
if dp[n]%2 == 0:
  print('Lose')
else:
  print('Win')