let eratos n =
  let a = Array.make (n + 1) true in
  a.(0) <- false; a.(1) <- false;
  let rec doit i j =
    if j > n then ()
    else begin
      a.(j) <- false;
      doit i (i + j)
    end in
  let doit i = doit i (i + i) in
  let m = float n |> sqrt |> truncate in
  for i = 2 to m do if a.(i) then doit i done;
  a

let solve n =
  let _, ps = Array.fold_right (fun e (i, lst) -> (i - 1, if e then i :: lst else lst)) (eratos n) (n, []) in
  let t = Array.make (n + 1) false in
  t.(0) <- true; t.(1) <- true;
  for i = 2 to n do
    let rec doit = function
      | [] -> ()
      | p :: _ when p > i -> ()
      | p :: ps ->
        t.(i) <- t.(i) || not t.(i - p);
        doit ps in
    doit ps
  done;
  t.(n)

let () =
  let n = read_int () in
  print_endline (if solve n then "Win" else "Lose")