#include using namespace std; typedef long long ll; #define REP(i,n) for(int i=0; i #define VLL vector #define VVI vector> #define VVLL vector> #define VC vector #define VS vector #define VVC vector> #define fore(i,a) for(auto &i:a) typedef pair P; template bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } const int INF = 1 << 30; const ll INFL = 1LL<<60; const ll mod = 1000000007; bool isPrime(int n) { for (int i = 2; i*i <= n; i++) { if (n%i == 0)return false; } return true; } int main() { int n; cin >> n; vector dp(10005, true); dp[2] = false; dp[3] = false; FOR(i, 4, n + 1) { bool b = true; FOR(j, 2, i) { if (isPrime(j)) { if (!dp[i - j]) { dp[i] = false; break; } } } } if (dp[n])cout << "Win" << endl; else cout << "Lose" << endl; return 0; }