import java.util.ArrayList; import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int N = scan.nextInt(); scan.close(); ArrayList list = new ArrayList(); for(int i = 2; i <= N; i++) { if(isPrime(i)) { list.add(i); } } if(N == 2 || N == 3) { System.out.println("Lose"); System.exit(0); } // a[i] = 1なら負け int []a = new int[N + 1]; Arrays.fill(a, 1); for(int i = 2; i <= N; i++) { for(int j = 0; j < list.size(); j++) { int t = i - list.get(j); if(t <= 1) { a[i] = 1; break; } if(t <= 3 ) { a[i] = 0; break; } if(a[t] == 1) { a[i] = 0; break; } } } if(a[N] == 1) { System.out.println("Lose"); }else { System.out.println("Win"); } } public static boolean isPrime(int n) { if (n < 2) return false; else if (n == 2) return true; else if (n % 2 == 0) return false; for (int i = 3; i < n; i += 2) { if (n % i == 0) { return false; } } return true; } }