package no007;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		ArrayList<Integer> prime = Sieve.primeList(10000);
		int[] dp = new int[10001];
		dp[0] = dp[1] = 1;
		for(int i=2;i<=10000;i++) {
			boolean win = false;
			for(int p:prime) {
				if (i < p) {
					break;
				}
				if (dp[i-p] ==0) {
					win = true;
					break;
				}
			}
			if (win) {
				dp[i] = 1;
			}
		}
		//System.out.println(Arrays.toString(dp));
		System.out.println(dp[n] == 1 ? "Win" : "Lose");
	}

}

class Sieve {
	public static boolean[] isPrimeArray(int max) {
		boolean[] isPrime = new boolean[max+1];
		Arrays.fill(isPrime, true);
		isPrime[0] = isPrime[1] = false;
		for(int i=2;i*i<=max;i++) {
			if (isPrime[i]) {
				int j = i * 2;
				while(j<=max) {
					isPrime[j] = false;
					j += i;
				}
			}
		}
		return isPrime;
	}
	public static ArrayList<Integer> primeList(int max) {
		boolean[] isPrime = isPrimeArray(max);
		ArrayList<Integer> primeList = new ArrayList<>();
		for(int i=2;i<=max;i++) {
			if (isPrime[i]) {
				primeList.add(i);
			}
		}
		return primeList;
	}
}