#include <iostream>
#include <cmath>
using namespace std;

static const int N = 10000;
bool flag = true;

int prime[N + 1] = {0};

bool isPrime(int n){
    if(n <= 1) return false;
    else if(n == 2) return true;
    else if(n % 2 == 0) return false;

    int num = sqrt(n);
    for(int i = 3; i <= num; i += 2){
        if(n % i == 0) return false;
    }

    return true;
}

int n; 

int a = 0;

void calc(int num){
    
}

int main(){
    cin >> n;

    for(int i = 0; i <= n; i++){
        prime[i] = isPrime(i);
    }

    int a = 0;

    while(1){
        if(flag){
            if(isPrime(a)){
                n = n - a;
            }
            if(n <= 1){
                cout << "Lose" << endl;
                return 0;
            }
            flag = !flag;
        }else{
            if (isPrime(a)){
                n = n - a;
            }
            if (n <= 1){
                cout << "Win" << endl;
                return 0;
            }
            flag = !flag;
        }
        a++;
    }
}