fn get_primes(n: usize) -> Vec<usize> {
    let mut flgs = vec![true; n+1];
    flgs[0] = false;
    flgs[1] = false;
    let limit = (n as f64).sqrt().ceil() as usize + 1;
    for i in 2..=limit {
        if !flgs[i] { continue; }
        for j in i..=(n/i) {
            flgs[j*i] = false;
        }
    }
    flgs.iter().enumerate().filter(|&pair| *pair.1).map(|pair| pair.0).collect()
}

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();

    let primes: Vec<usize> = get_primes(n);
    let mut result: Vec<Option<usize>> = vec![None; n+1];
    result[2] = Some(0);
    if n > 2 {
        result[3] = Some(0);
    }
    for i in 4..=n {
        let mut temp: Vec<usize> =vec![];
        for p in primes.iter() {
            if *p > i - 2 { break; }
            if temp.contains(&p) { continue; }
            temp.push(result[i - p].unwrap());
        }
        temp.sort();
        result[i] = temp.iter().enumerate()
            .filter(|pair| pair.0 != *pair.1)
            .map(|pair| pair.0)
            .nth(0)
            .or(Some(temp.len()));
    }
    println!("{}", if result[n] == Some(0) { "Lose" } else { "Win" });
}