//#include #include using namespace std; typedef long long ll; typedef pair p; const int INF = 1e9; const ll LINF = ll(1e18); const int MOD = 1000000007; const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}; const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; #define yes cout << "Yes" << endl #define YES cout << "YES" << endl #define no cout << "No" << endl #define NO cout << "NO" << endl #define rep(i, n) for (int i = 0; i < n; i++) #define ALL(v) v.begin(), v.end() #define debug(v) \ cout << #v << ":"; \ for (auto x : v) \ { \ cout << x << ' '; \ } \ cout << endl; template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } //cout< a; //エラトステネスの篩 vector sieve(int n) { vector isp(n + 1, true); isp[0] = false; isp[1] = false; for (int i = 2; pow(i, 2) <= n; i++) { if (isp[i]) for (int j = 2; i * j <= n; j++) isp[i * j] = false; } return isp; } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> n; vector isp = sieve(n); vector v; rep(i, isp.size()) { if (isp[i]) v.push_back(i); } vector dp(n + 1, false); dp[0]=true; dp[1]=true; for (int i = 2; i <= n; i++) { rep(j, v.size()) { if (i - v[j] < 0) continue; if(!dp[i-v[j]]){ dp[i]=true; break; } } } //debug(dp); //debug(v); if(dp[n]){ cout<<"Win"<<"\n"; } else{ cout<<"Lose"<<"\n"; } }