import java.util.*;
import java.math.*;
import java.io.*;
 
public class Main {
	static ArrayList<Integer> pl;
	static int[][] memo;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		pl = new ArrayList<Integer>();
		boolean[] isntPrime = new boolean[n+1];
		pl.add(2);
		for(int i = 3; i <= n; i += 2) {
			if(!isntPrime[i]) pl.add(i);
			for(int j = i + i; j <= n; j += i) {
				isntPrime[j] = true;
			}
		}
		memo = new int[2][n+1];
		dfs(true,n);
		if(memo[0][n] == 1) System.out.println("Win");
		else System.out.println("Lose");
	}
	static boolean dfs(boolean a,int b) {
		if(a) {
			if(memo[0][b] != 0) return memo[0][b]==1?true:false;
			for(int i = 0; i < pl.size(); i++) {
				if(b - pl.get(i) <= 1) break;
				boolean ret = dfs(false,b - pl.get(i));
				if(ret) {
					memo[0][b] = 1;
					return true;
				}
			}
			memo[0][b] = -1;
			return false;
		}
		else {
			if(memo[1][b] != 0) return memo[1][b]==1?true:false;
			for(int i = 0; i < pl.size(); i++) {
				if(b - pl.get(i) <= 1) break;
				boolean ret = dfs(true,b - pl.get(i));
				if(!ret) {
					memo[1][b] = -1;
					return false;
				}
			}
			memo[1][b] = 1;
			return true;
		}
	}
	
}