#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

const int MAX_N = 10010;
vector<int> isPrime(MAX_N, 1);
vector<int> primes;

void buildPrime() {
    isPrime[0] = isPrime[1] = 0;
    for(int i = 2; i < MAX_N; ++i) {
        if(isPrime[i]) {
            primes.push_back(i);
            for(int j = i + i; j < MAX_N; j += i) {
                isPrime[j] = 0;
            }
        }
    }
}

int main(){
    buildPrime();
    int n;
    cin >> n;
    vector<int> win(MAX_N);
    win[0] = win[1] = 1;
    REP(i, 2, MAX_N) {
        int f = 0;
        for(int j = 0; j < primes.size() && primes[j] <= i; ++j) {
            if(win[i - primes[j]] == 0) f = 1;
        }
        win[i] = f;
    }
    cout << (win[n] ? "Win" : "Lose") << endl;
    return 0;
}