#include #include using namespace std; vector prime; bool nonPrime[10001]; void makePrime(){ for(int i = 2; i <= 10000; i++){ if(nonPrime[i]) continue; prime.push_back(i); for(int j = i+i; j <= 10000; j += i){ nonPrime[j] = true; } } } int main(){ int n; cin >> n; makePrime(); bool win[10001]; win[0] = true; win[1] = true; for(int i = 2; i <= n; i++){ for(int j : prime){ if(i-j < 0) break; win[i] |= !win[i-j]; } } if(win[n]) cout << "Win" << endl; else cout << "Lose" << endl; return 0; }