#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<int> getprimes(int n) {
    bool isprime[n+1];
    fill(isprime, isprime+n+1, true);
    vector<int> 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;
    }
    return primes;
}

int main() {
    int n;
    cin>>n;
    vector<int> primes = getprimes(n);
    bool dp[n+1] {};
    dp[0] = dp[1] = true;
    for (int i = 2; i <= n; i++) {
        for (int j = 0; j < primes.size() && primes[j] <= i; j++) {
            if (!dp[i-primes[j]]) {
                dp[i] = true;
                break;
            }
        }
    }
    if (dp[n]) puts("Win");
    else puts("Lose");
    return 0;
}