#include <algorithm>
#include <cstdio>

int N;
bool isPrime[10011];
int primes[10011], p_length, memo[10001];

// rec(n): 自分にnで回ってきたとき勝てるか
bool rec(int n){
    if(n <= 1){return true;}
    if(memo[n] != -1){return memo[n];}

    int maxIndex = std::upper_bound(primes, primes+p_length, n) - primes;
    bool f = false;
    for(int i=0;i<maxIndex;i++){
        f = f || !rec(n-primes[i]);
    }
    
    return memo[n] = f;
}

int main(){
    std::fill(isPrime, isPrime+10011, true);

    primes[0] = 2;
    for(int i=4;i<=10010;i+=2){isPrime[i] = false;}
    p_length = 1;
    
    for(int i=3;i<=10010;i+=2){
        if(isPrime[i]){
            primes[p_length++] = i;
            for(int j=i*i;j<=10010;j+=i){
                isPrime[j] = false;
            }
        }
    }

    scanf("%d", &N);

    std::fill(memo, memo+10001, -1);
    if(rec(N)){
        puts("Win");
    }else{
        puts("Lose");
    }
}