#include #include #include using namespace std; //S struct SieveEratos{ vector t; SieveEratos(int n):t(n+1,true){ t[0] = t[1] = 0; for(int i = 2; n >= i; i++){ if(t[i]){ for(int j = i+i; n >= j; j+=i){ t[j] = 0; } } } } bool operator[](int x){return t[x];} }; //E int main(){ int n;cin>>n; SieveEratos A(n+1); vector p; for(int i = 0; n >= i; i++){ if(A[i]){ p.push_back(i); } } vector mex(n+1,-1); mex[0] = mex[1] = 1; for(int i = 2; n >= i; i++){ vector C(n+1,0); for(int j = 0; p.size() > j; j++){ if(i-p[j] < 0)break; C[mex[i-p[j]]] = 1; } int x = 0; while(C[x])x++; mex[i] = x; } // for(int i = 0; n >= i; i++){ // cout << mex[i] << " "; // } // cout << endl; if(mex[n]){ cout << "Win" << endl; }else{ cout << "Lose" << endl; } }