#include <iostream>
#include <vector>
using namespace std;

vector<int> getprimelst(int n) {
    vector<bool> isprime(n + 1, true);
    isprime[0] = isprime[1] = false;

    for (int i = 2; i <= n; ++i) {
        if (!isprime[i]) continue;

        for (int j = i * 2; j <= n; j += i) {
            isprime[j] = false;
        }
    }

    vector<int> primelst;
    for (int i = 0; i <= n; ++i) {
        if (isprime[i]) primelst.push_back(i);
    }

    return primelst;
}

int main() {
    int N;
    cin >> N;

    vector<bool> dp(N + 1);
    dp[0] = dp[1] = true;
    dp[2] = dp[3] = false;
    vector<int> primelst = getprimelst(N);
    for (int i = 0; i <= N; ++i) {
        for (auto p : primelst) {
            if (i + p <= N) {
                dp[i + p] = !dp[i] || dp[i + p];
            }
        }
    }

    if (dp[N]) {
        cout << "Win" << endl;
    } else {
        cout << "Lose" << endl;
    }
}