#include <bits/stdc++.h>

using i64 = long long;
std::vector<int> p;
int fact = []() {
    constexpr int n = 1e5;
    std::vector<int> st(n + 1, 0);
    st[0] = st[1] = 1;
    for (int i = 2; i <= n; ++i) {
        if (!st[i]) {
            p.push_back(i);
        }
        for (auto &pi : p) {
            if (1LL * i * pi > n) break;
            st[i * pi] = 1;
            if (i % pi == 0) break;
        }
    }
    return 0;
}();

int main() {

    std::cin.tie(nullptr)->sync_with_stdio(false);

    
    i64 n;
    std::cin >> n;

    std::vector<int> dp(n + 1, -2);
    const int m = p.size();
    dp[0] = dp[1] = 1;
    for (int i = 0; i < m; ++i) {
        for (int j = n; j >= 0; --j) {
            if (j - p[i] >= 0 && dp[j - p[i]] == 1) {
                dp[j] = std::max(dp[j], -1);
            }
            if (j - p[i] >= 0 && dp[j - p[i]] == -1) {
                dp[j] = std::max(dp[j], 1);
            }
        }
    }
    std::cout << (dp[n] == 1 ? "Win" : "Lose") << '\n';

    return 0;
}