#include<iostream>
#include<vector>
#include<algorithm>
#define ll long long

using namespace std;


vector<int> prime(int n){
    vector<bool> is_prime(n+1,true);
    vector<int> p;
    for(int i=2;i <= n;i++){
        if(is_prime[i]){
            for(int j=2*i;j <= n;j+=i){
                is_prime[j] = false;
            }
            p.push_back(i);
        }
    }
    return p;
}

vector<bool> dp(10010,false);
vector<bool> calced(10010,false);

bool dfs(int n){


    if(n == 0 || n == 1){
        return dp[n] = true;
    } 
    if(n == 2 || n == 3) {
        return dp[n] = false;
    }
    if(calced[n]) return dp[n];

    calced[n] = true;
    
    bool res = false;
    for(auto &x : prime(n)){
        if(!dfs(n-x)){
            return dp[n] = true;
        }
    }
    return dp[n] = false;
}

int main(){
    int n;
    cin >> n;
    if(dfs(n)) cout << "Win" << endl;
    else cout << "Lose" << endl;
    return 0;
}