#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }


vector<int> prime_sieve(int n){
    vector<int> sieve(n+1, 0), prime;
    for (int i=2; i<n+1; i++){
        if (sieve[i]==0){
            sieve[i] = i;
            prime.emplace_back(i);
        }
        for (int p: prime){
            if (p > sieve[i] || i * p > n) break;
            sieve[i * p] = p;
        }
    }
    return sieve;
}


bool dp[10101];

int main(){
    int n; cin>>n;
    dp[0] = true;
    dp[1] = true;
    vector<int> sieve = prime_sieve(n);
    vector<int> p;

    for (int x = 2; x<=n; x++){
        if (x == sieve[x]) p.push_back(x);
        bool win = false;
        for(int i: p) if(!dp[x-i]) win=true;
        dp[x] = win;
    }
    if (dp[n]) cout<<"Win"<<endl;
    else cout<<"Lose"<<endl;
    return 0;
}