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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n;
        cin >> n;

        auto isPrime = [&](int n) {
            if (n == 1) { return false; }
            for (int i = 2; i * i <= n; i++) {
                if (n % i == 0) {
                    return false;
                }
            }
            return true;
        };

        vector<int> primes;
        for (int x = 1; x <= n; x++) {
            if (isPrime(x)) {
                primes.push_back(x);
            }
        }

        vector<int> dp(n);
        for (int i = 2; i <= n; i++) {
            for (auto p : primes) {
                if (i - p <= 1) {
                    break;
                }
                dp[i] |= !dp[i - p];
            }
        }

        cout << (dp[n] ? "Win" : "Lose") << '\n';
    };
    
    solve();
    
    return 0;
}