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

const int kMAX_N = 10010;

int N;
vector<int> primes;
int memo[kMAX_N];

int rec(int number) {
    if (memo[number] >= 0) return memo[number];
    if (number == 0 || number == 1) return memo[number] = 1;

    int result = 0;
    for (int i = 0; i < primes.size(); i++) {
        int p = primes[i];
        if (p > number) break;
        if (!rec(number - p)) {
            result = 1;
            break;
        }
    }
    return memo[number] = result;
}

void Solve() {
    memset(memo, -1, sizeof(memo));
    for (int i = 2; i <= N; i++) {
        // 試し割り
        bool is_prime = true;
        for (int j = 2; j * j <= i; j++) {
            if (i % j == 0) {
                is_prime = false;
                break;
            }
        }
        if (is_prime) primes.push_back(i);
    }
    if (rec(N)) {
        cout << "Win" << endl;
    } else {
        cout << "Lose" << endl;
    }
}

int main() {
    cin >> N;

    Solve();

    return 0;
}