#include #include std::vector primes(int n) { std::vector is_prime(n + 1, true); is_prime.at(0) = false; is_prime.at(1) = false; std::vector res; for (int i = 2; i < n + 1; i++) { if (is_prime.at(i)) { res.push_back(i); for (int j = i * 2; j < n + 1; j += i) { is_prime.at(j) = false; } } } return res; } bool solve(int N) { auto P = primes(N); std::vector dp(N + 1, false); dp.at(0) = true; dp.at(1) = true; for (int n = 2; n < N + 1; n++) { for (auto &p: P) { if (n - p < 0) { break; } if (!dp.at(n - p)) { dp.at(n) = true; } } } return dp.at(N); } int main() { int N; std::cin >> N; auto ans = solve(N) ? "Win" : "Lose"; std::cout << ans << std::endl; }