#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define srep(i, s, n) for (int i=(s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define fore(i,x) for(auto i:x)
#define pb push_back

using vi=vector<int>;
using vvi=vector<vi>;
using vb=vector<bool>;
using vvb=vector<vb>;
using vs=vector<string>;
using vll=vector<long long>;
using vvll=vector<vll>;
using vc=vector<char>;
using vvc=vector<vc>;
using ll=long long;

void Yes(bool ok){ cout << (ok ? "Yes" : "No") << "\n";}

vector<bool> make_is_prime(int N) {
    vector<bool> prime(N + 1, true);
    if (N >= 0) prime[0] = false;
    if (N >= 1) prime[1] = false;
    for (int i = 2; i * i <= N; i++) {
        if (!prime[i]) continue;
        for (int j = i * i; j <= N; j += i) {
            prime[j] = false;
        }
    }
    return prime;
}

int main(){
    int N; cin >> N;
    vb isprime=make_is_prime(10000);
    vb iswin(10001);
    iswin[0]=true,iswin[1]=true;
    srep(i,4,10001){
        bool win=false;
        srep(j,1,i+1){
            if(isprime.at(j) && !iswin.at(i-j)) win=true;
        }
        iswin.at(i)=win;
    }
    if(iswin.at(N)) cout << "Win" << "\n";
    else cout << "Lose" << "\n";
    
}