import sys
sys.setrecursionlimit(10**6)
n=int(input())

def get_primes(n):
  is_prime = [True] * (n + 1)
  is_prime[0] = False
  is_prime[1] = False
  for i in range(2, int(n ** 0.5) + 1):
    if is_prime[i]:
      for j in range(i * i, n + 1, i):
        is_prime[j] = False
  return [i for i in range(n + 1) if is_prime[i]]

primes = get_primes(n)
dp=[None]*(n+1)
dp[0]=dp[1]=True

def dfs(x):
  if dp[x]!=None:
    return dp[x]
  for p in primes:
    if x-p<0:
      break
    if not dp[x-p]:
      return True
  return False  
print('Win' if dfs(n) else 'Lose')