#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

int main()
{
    int N;
    cin>>N;
    VI isPrime(N+1, true);
    isPrime[0] = isPrime[1] = false;
    VI primes;
    for(int i=2;i<=N;i++){
        if(!isPrime[i]) continue;
        primes.push_back(i);
        for(int j=i+i;j<=N;j+=i) isPrime[j] = false;
    }
    VI dp(N+1);
    dp[0] = dp[1] = 1;
    for(int i=2;i<=N;i++){
        for(auto p : primes){
            if(p > i) break;
            if(!dp[i - p]) {
                dp[i] = 1;
                break;
            }
        }
    }
    puts(dp[N]?"Win":"Lose");
    return 0;
}