import java.util.*;

public class No7 {
    public static boolean checkPrime (int n) {
        boolean b = true;
        if (n==2 || n==3 || n==5) ;
        else if ((n & 1)==0 || n==1) b = false;
        else {
            for (int i = 3; i < n/2; i+=2) {
                if (n % i==0) {
                    b = false;
                    break;
                }
            }
        }
        return b;
    }
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int N = scan.nextInt();
        if (N < 4) {
            System.out.println("Win");
            System.exit(0);
        }

        int[] prime = new int[N + 1];
        boolean[] win = new boolean[N + 1];
        for (int i = 0; i < N + 1; i++) {
            prime[i] = 0;
            win[i] = false;
        }
        prime[0] = 2; prime[1] = 3; win[0] = win[1] = true;

        int[] near = new int[N + 1];
        int tmp = 1, j = 2;
        for (int i = 4; i < N + 1; i++) {
            near[i] = tmp;
            if (checkPrime(i)) {
                prime[j] = i;
                tmp = j;
                j++;
            }
        }

        int tmp2;
        for (int i = 4; i < N + 1; i++) {
            for (int k = i; k >= 0; k--) {
                tmp2 = i - prime[near[k]];
                if (!win[tmp2]) {
                    win[i] = true;
                    break;
                }
            }
        }

        System.out.println(win[N] ? "Win" : "Lose");
    }
}