# Read N from input
n = gets.not_nil!.to_i

# Sieve of Eratosthenes to find primes up to N
is_prime = Array.new(n + 1, true)
primes = [] of Int32

(2..n).each do |i|
  if !is_prime[i]
    next
  end
  
  primes << i
  j = i * 2
  while j <= n
    is_prime[j] = false
    j += i
  end
end

# Dynamic programming for the game
g = Array.new(n + 1, false)
g[0] = true
g[1] = true

(2..n).each do |i|
  primes.each do |p|
    if i < p
      break
    end
    
    if !g[i - p]
      g[i] = true
      break
    end
  end
end

puts g[n] ? "Win" : "Lose"