#include #include const int MAX_P = 10000; std::vector< int > prime(MAX_P,1); std::vector< int > table; int N; void eratosthenes(){ int i = 2; prime[0] = 0; while(i <= MAX_P){ if( prime[i - 1] == 1){ int j = 2 * i; while(j <= MAX_P){ prime[j - 1] = 0; j += i; } } ++i; } } int rec(int i){ if(table[i] != -1){ return table[i]; }else{ std::vector< int > temp(N + 1, 0); int t; for(int j = 0; j < i; ++j){ if(prime[j] == 1){ t = rec(i - (j + 1)); temp[t] = 1; } } for(int j = 0; j < N + 1; ++j){ if(temp[j] == 0){ table[i] = j; break; } } return table[i]; } } int main(){ eratosthenes(); std::cin >> N; table.resize(N + 1); table[0] = table[1] = 0; for(int i = 2; i < N + 1; ++i){ table[i] = -1; } rec(N); if(table[N] == 1 || table[N] == 0){ std::cout << "Lose" << std::endl; }else{ std::cout << "Win" << std::endl; } return 0; }