#include //#include #include #include using namespace std; #define MAXN 10000 vector dp(MAXN); vector plist(MAXN); int psize; void makedp(int n) { dp[0] = dp[1] = true; dp[2] = false; for( int i = 3; i <= n ; i++ ) { dp[i] = false; for( int j = 0; plist[j] <= i && j < psize; j++ ) { if( dp[i - plist[j]] == false ) { dp[i] = true; break; } } } } bool isprime( int n ) { if( n == 2 || n == 1) { return true; } for( int i = 2; i <= sqrt(n); i+=1 ) { if( n % i == 0 ) { return false; } } return true; } void makeprime( int n ) { for( int i = 2; i < n; i++ ) { if( isprime( i ) ) { plist[psize++] = i; } } } int main() { int N; cin >>N; makeprime(N); /* for( int i = 0; i < psize; i++ ) { cout << plist[i] << " "; } cout << endl; */ makedp(N); /* for( int i = 0; i <= N; i++ ) { if( dp[i] == true ) { cout << i << " WIN" << endl; } else { cout << i << " LOSE" << endl; } } /**/ if( dp[N] == true ) { cout << "Win" << endl; } else { cout << "Lose" << endl; } return 0; }