import math, sequtils, strutils, sugar

let n = parseInt readLine stdin

var isPrimes = true.repeat n.succ
for i in [0, 1]:
  isPrimes[i] = false

let rn = toInt ceil sqrt toFloat n
for i in 2 .. rn:
  if not isPrimes[i]:
    continue
  
  for i2 in countup(i ^ 2, n, i):
    isPrimes[i2] = false

let primes = collect(newSeq):
  for i, v in isPrimes:
    if v: i

const
  win = 1
  lose = 0

var dp = repeat(-1, n.succ)

proc fn(v: int): int =
  result = lose
  
  for p in primes:
    if p > v:
      break
    
    let v2 = v - p
    if v2 in [0, 1]:
      continue
    
    if dp[v2] == -1:
      dp[v2] = fn v2
    
    if dp[v2] == lose:
      return win
    
if n.fn == win:
  echo "Win"
else:
  echo "Lose"