#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> prime(n+1, 1), png(n+1, 0), p1;
    prime[0] = 0, prime[1] = 0;
    for (int i = 2; i <= pow(n, 0.5); i++){
        for (int j = i*i; j <= n; j += i){
            if(!(j%i)) prime[j] = 0;
        }
    }
    for (auto x : prime)
    if (n == 2 || n == 3) {
        cout << "Lose" << endl;
        return 0;
    }
    for (int i = 2; i <= n; i++){
        if (!(png[i])){
            for (int j = 2; j <= n-i; j++){
                if (prime[j]) png[i+j] = 1;
            }
        }
    }
    cout << ((prime[n]) ? "Win" : "Lose") << endl;
}