#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>


std::vector<int> primeNumbers(const int n) {
    std::vector<int> prime_numbers;

    for (int i = 2; i < n+1; i++) {
        prime_numbers.push_back(i);
    }

    for (auto itr = prime_numbers.begin(); *itr < sqrt(n); itr++) {
        int p = *itr; auto start = itr; start++;
        auto end = std::remove_if(start, prime_numbers.end(), [=](int x) { return x % p == 0; });
        prime_numbers.erase(end, prime_numbers.end());
    }

    return prime_numbers;
}


std::vector<int> vectorLessThanN(std::vector<int> vec, const int n) {
    auto end = std::remove_if(vec.begin(), vec.end(), [=](int x) { return x > n; });
    vec.erase(end, vec.end());
    return vec;
}


int main(int argc, char const* argv[]) {
    int n; std::cin >> n;
    std::vector<bool> dp(n+10, false);

    dp[0] = true;
    dp[1] = true;

    auto prime_numbers = primeNumbers(n+10);
    for (int i = 2; i < n+1; i++) {
        for (auto&& p : vectorLessThanN(prime_numbers, i)) {
            dp[i] = dp[i] + !dp[i-p];
            if (dp[i]) break;
        }
    }

    if (dp[n]) {
        std::cout << "Win" << std::endl;
    } else {
        std::cout << "Lose" << std::endl;
    }
    return 0;
}