#include <iostream>
#include <vector>
#include <queue>

using namespace std;
const int INF = 1145141919;

int main() {
    vector<bool> isPrime(10010, true);
    vector<int> prime;
    isPrime[0] = false, isPrime[1] = false;
    for (int i = 2; i <= 10000; i++) {
        if (isPrime[i]) {
            prime.push_back(i);
            for (int j = i * i; j <= 10000; j += i)isPrime[j] = false;
        }
    }

    vector<bool> dp(10010, true);
    for (int i = 2; i <= 10000; i++) {
        bool found = false;
        for (auto x:prime) {
            if (x > i)break;
            if (!dp[i - x]) {
                found = true;
                break;
            }
        }
        dp[i] = found;
    }

    int n;
    cin >> n;
    cout << (dp[n] ? "Win" : "Lose") << endl;
    return 0;
}