def Eratosthenes(N):
  IsPrime=[True] * (N + 1)

  i = 2
  while i**2 <= N:
    if not IsPrime[i]:
      i += 1
      continue

    k = 2
    while i*k <= N:
      IsPrime[i*k] = False
      k += 1

    i += 1

  return [i for i in range(2,N+1) if IsPrime[i]]

N = int(input())
primes = Eratosthenes(N)

dp = [False] * (N + 1)
dp[0] = True
dp[1] = True

for i in range(2, N + 1):
  # False に導ければ True（勝ち）
  for prime in primes:
    if i + prime > N:
      break

    if dp[i]:
      dp[i+prime] = True
      break

if dp[N]:
  print('Win')
else:
  print('Lose')