#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define llong long long

vector<int> get_primes() {
    vector<bool> flgs(10001, true);
    flgs[0] = false;
    flgs[1] = false;
    int limit = 100;
    vector<int> ret;
    for(int i=2; i<=limit; i++) {
        if(!flgs[i]) continue;
        for(int j=i*i; j<10001; j=j+i) {
            flgs[j] = false;
        }
    }
    rep(i, 10001) if(flgs[i]) ret.push_back(i);
    return ret;
}

int main() {
    int n;
    cin >> n;
    
    vector<int> primes = get_primes();
    vector<int> result(10001, 10000);
    result[0] = 0;
    result[1] = 0;
    result[2] = 1;
    result[3] = 1;
    for(int i=2; i<10001; i++) {
        for(int p: primes) {
            if(i+p > 10001) break;
            result[i+p] = min(result[i]+1, result[i+p]);
        }
    }
    if(result[n] % 2 == 1) {
        cout << "Lose\n";
    } else {
        cout << "Win\n";
    }
}