#![allow(unused_imports)]

use std::io::{self, BufRead};
use std::str::FromStr;
use std::collections::*;
use std::cmp::*;

#[allow(dead_code)]
struct Parser<'a> {
    tokens: &'a mut Iterator<Item = String>,
}
#[allow(dead_code)]
impl<'a> Parser<'a> {
    fn new(i: &'a mut Iterator<Item = String>) -> Self {
        Parser {tokens: i}
    }
    fn take<T: FromStr>(&mut self) -> T {
        match self.tokens.next().expect("empty iterator").parse() {
            Ok(x) => x,
            Err(_) => panic!()
        }
    }

    fn take_some<T: FromStr>(&mut self, n: usize) -> Vec<T> {
        self.tokens.take(n).map(|s| match s.parse() { Ok(x) => x, Err(_) => panic!() } ).collect()
    }
}

//sieve[k] is true if k is a prime
//[0, n)
#[allow(dead_code)]
fn sieve_of_eratosthenes(n: u64) -> Vec<bool> {
    let mut v = vec![true; n as usize];
    v[0] = false;
    v[1] = false;
    for i in 2..n {
        if !v[i as usize] {
            continue;
        }
        let mut j = 2*i;
        while j < n {
            v[j as usize] = false;
            j += i;
        }
    }
    v
}
fn listup_primes_under(n: u64) -> Vec<u64> {
    sieve_of_eratosthenes(n).into_iter().zip(0..n).filter(|x| x.0).map(|x| x.1).collect()
}

fn solve(v: &mut Vec<Option<bool>>, n: u64, p: &Vec<u64>) -> bool {
    if let Some(b) = v[n as usize] {
        return b;
    } else {
        for &pi in p.iter().filter(|&&x| x <= n) {
            if !solve(v, n-pi, p) {
                v[n as usize] = Some(true);
                return true;
            }
        }
        v[n as usize] = Some(false);
        return false;
    }
}

fn main() {
    let stdin = io::stdin();
    let mut tokens = stdin.lock().lines().filter_map(|x| x.ok()).flat_map(|x| x.split_whitespace().map(|s| s.to_owned()).collect::<Vec<String>>());
    let mut parser = Parser::new(&mut tokens);

    let n: u64 = parser.take();
    let p = listup_primes_under(n+1);

    let mut v = Vec::new();
    v.push(Some(true));
    v.push(Some(true));
    v.resize((n+1) as usize, None);
    println!("{}", if solve(&mut v, n, &p) {"Win"} else {"Lose"});
}