import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        if (n <= 3) {
            System.out.println("Lose");
            return;
        }
        HashSet<Integer> loses = new HashSet<>();
        loses.add(2);
        loses.add(3);
        TreeSet<Integer> primes = new TreeSet<>();
        primes.add(2);
        primes.add(3);
        for (int i = 4; i <= n; i++) {
            boolean flag = true;
            for (int x : primes) {
                if (loses.contains(i - x)) {
                    flag = false;
                    break;
                }
            }
            if (flag) {
                loses.add(i);
            }
            if (isPrime(i, primes)) {
                primes.add(i);
            }
        }
        if (loses.contains(n)) {
            System.out.println("Lose");
        } else {
            System.out.println("Win");
        }
    }
    
    static boolean isPrime(int x, TreeSet<Integer> primes) {
        for (int y : primes) {
            if (y > Math.sqrt(x)) {
                break;
            }
            if (x % y == 0) {
                return false;
            }
        }
        return true;
    }
}