use std::{collections::HashSet, io};

fn get_primes(max: usize) -> Vec<usize> {
    let mut is_prime = vec![true; max + 1];
    is_prime[0] = false;
    is_prime[1] = false;

    for n in 2..=max {
        if !is_prime[n] {
            continue;
        }
        if n * n > max {
            break;
        }
        for i in ((n * n)..=max).step_by(n) {
            is_prime[i] = false;
        }
    }

    (0..=max).filter(|&n| is_prime[n]).collect()
}

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

    let primes = get_primes(n);
    let mut table = vec![1; n + 1];

    for i in 2..=n {
        let mut reachable = HashSet::new();
        for &p in &primes {
            if p > i {
                break;
            }
            reachable.insert(table[i - p]);
        }
        table[i] = (0..=i).find(|n| !reachable.contains(n)).unwrap();
    }

    println!("{}", if table[n] > 0 { "Win" } else { "Lose" });
}