#include using namespace std; #define repu(i, a, b) for (int i = (a); i < (b); ++i) #define repd(i, a, b) for (int i = (a); i > (b); --i) #define mem(a, x) memset(a, x, sizeof(a)) #define all(a) a.begin(), a.end() #define uni(a) a.erase(unique(all(a)), a.end()) typedef long long ll; const int MOD = 1000000007; template inline T tmin(T a, U b) {return (a < b) ? a : b;} template inline T tmax(T a, U b) {return (a > b) ? a : b;} template inline void amax(T &a, U b) {if (b > a) a = b;} template inline void amin(T &a, U b) {if (b < a) a = b;} template inline T tabs(T a) {return (a > 0) ? a : -a;} template T gcd(T a, T b) {while (b != 0) {T c = a; a = b; b = c % b;} return a;} const int N = 10005; bool is_prime[N]; int dp[N]; vector prime; int go(int n) { if (dp[n] >= 0) return dp[n]; int res = 0; repu(i, 0, prime.size()) { if (prime[i] >= n - 1) break; res |= 1 - go(n - prime[i]); } return res; } int main(int argc, char *argv[]) { ios_base::sync_with_stdio(false); int n; cin >> n; mem(is_prime, true); repu(i, 2, n + 1) { if (is_prime[i]) { prime.push_back(i); for (int j = i + i; j <= n; j += i) is_prime[j] = false; } } mem(dp, -1); dp[2] = 0; printf("%s\n", go(n) == 1 ? "Win" : "Lose"); return 0; }