#[allow(unused_macros)]
macro_rules! input {
    ( $($t:ty),* ) => {{
        let mut s = String::new();
        std::io::stdin().read_line(&mut s);
        let mut splits = s.trim().split_whitespace();
        ($( { splits.next().unwrap().parse::<$t>().unwrap() },)*)
    }}
}

fn is_prime(n: &u64) -> bool {
    if *n == 2 {
        return true;
    }
    let root = (*n as f64).sqrt().ceil() as usize + 1;
    for i in 2..root {
        if *n as usize % i == 0 {
            return false;
        }
    }
    return true;
}

fn primes(n: u64) -> Vec<u64> {
    (2..n).filter(&is_prime).collect()
}

#[allow(unused_must_use)]
#[allow(unused_variables)]
fn solve() {
    let (n,) = input!(usize);
    
    let primes = primes(n as u64);

    let mut res = Vec::with_capacity(n);
    res.push(true); // 0
    res.push(true); // 1

    for i in 2..=n {
        let mut first_win = false;
        for p in &primes {
            let p = *p as usize;
            if res.len() <= p && i < p {
                break;
            }

            if !res[i - p] {
                first_win = true;
                break;
            }
        }

        if first_win {
            res.push(true);
        } else {
            res.push(false);
        }
    }

    if res[n] {
        println!("Win");
    } else {
        println!("Lose");
    }
}

fn main() {
    solve();
}