import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
	static ArrayList<Integer> PrimeList=new ArrayList<>();
	static int[] judge;
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		judge=new int[n+1];
		Arrays.fill(judge, 0);//0は未探索とする
		boolean isPrime[]=new boolean[n+1];
		isPrime=isPrime(n);
		//for(int i=0;i<=n;i++){
		//System.out.println("isPrime["+i+"]="+isPrime[i]);
		//}
		PrimeList=PrimeList(n);
		if(judge(n)){
			System.out.println("Win");
		}else{
			System.out.println("Lose");
		}
	}

	public static boolean[] isPrime(int n){
		boolean isPrime[]=new boolean[n+1];
		Arrays.fill(isPrime, true);
		isPrime[0]=false;
		isPrime[1]=false;
		for(int i=2;i<n;i++){
			if(isPrime[i]){
				for(int j=2;j*i<=n;j++){
					isPrime[i*j]=false;
				}
			}
		}
		return isPrime;
	}
	public static ArrayList<Integer> PrimeList(int n){
		ArrayList<Integer> PrimeList=new ArrayList<>();
		boolean[] isPrime=new boolean[n+1];
		isPrime=isPrime(n);
		for(int i=2;i<=n;i++){
			if(isPrime[i]){
				PrimeList.add(i);
			}
		}
		return PrimeList;
	}
	//judge(n)の数字で回って来た時の自分の勝ち負けを調べる。
	public static boolean judge(int n){
		boolean j=false;
		int p;
		if(judge[n]==1)return true;
		if(judge[n]==-1)return false;
		for(int i=0;i<PrimeList.size()&&PrimeList.get(i)<=n;i++){
			p=PrimeList.get(i);
			if(!judge(n-p)){
				j=true;
			}
		}
		if(n==1||n==0)return true;
		if(j)judge[n]=1;
		if(!j)judge[n]=-1;
		return j;
	}
}