#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; bool not_prime[10001]; int memo[10001]; bool rec(int i) { if (i == 0) return false; if (i == 1) return true; if (memo[i] != -1) return memo[i]; for (int j = i; j >= 1; j--) { if (not_prime[j]) continue; if (!rec(i-j)) return memo[i]=true; } return memo[i]=false; } int main() { int n; cin >> n; memset(not_prime, false, sizeof(not_prime)); memset(memo, -1, sizeof(memo)); not_prime[1] = true; for (int i = 2; i <= n; i++) { for (int j = i+i; j <= n; j+=i) { not_prime[j] = true; } } if (rec(n)) { cout << "Win" << endl; }else { cout << "Lose" << endl; } }