import Foundation


let n = Int(readLine()!)!

let primes =  { () -> [Int] in
  var multiples = Set<Int>()
  return (2 ..< n).filter { i in
    if i == 2 {
      return true
    }
    if i % 2 == 0 {
      return false
    }
    if multiples.contains(i) {
      return false
    }
    var m = 3
    while i * m < n {
      multiples.insert(i * m)
      m += 2
    }
    return true
  }
}()

var dp: [Bool] = [true, true]
for i in 2 ... n {
  var found = false
  for p in primes {
    if p > i {
      break
    }
    if !dp[i - p] {
      found = true
      break
    }
  }
  dp.append(found)
} 
if dp[n] {
  print("Win")
} else {
  print("Lose")
}