#include using namespace std; struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star; #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define vv(type, c, m, n, i) vector> c(m, vector(n, i)) #define mat(type, c, m, n) vector> c(m, vector(n));for(auto& r:c)for(auto& i:r)cin>>i; #define rep(i,a,n) for(int i=(a), i##_len=(n); ii##_len; --i) #define each(x,y) for(auto &(x):(y)) #define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { cin >> t; } templatevoid Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); } #define vec(type, c, n) vector c(n);for(auto& i:c) cin>>i; #define len(x) ((int)(x).size()) #define mp make_pair #define eb emplace_back #define em emplace #define pb pop_back #define fi first #define se second #define get(a, i) get(a) #define bit_count __builtin_popcount #define mt make_tuple typedef long long ll; typedef long double ld; typedef vector vi; typedef vector vd; typedef vector vll; typedef vector vs; typedef vector vb; typedef pair pii; #define mini min_element #define maxi max_element #define sum accumulate #define chmax(a,b) if(ab)a=b template inline void print(T t){cout << t << "\n";} template inline void print(H h, T... t){cout << h << " ";print(t...);} vi ret{2}; void makePrime(int n) { vb ok(n, true); ret.reserve(n + 1); for (int i = 3; i <= n; i += 2) { int i2 = i / 2; if (!ok[i2]) continue; ret.eb(i); for (int j = i2 + i, n2 = n / 2; j < n2; j += i) ok[j] = false; } } bool b[10001]; string solve() { b[0] = b[1] = true; var(int, n); makePrime(n); int len_ret = len(ret); rep(i, 2, n + 1) { rep(j, 0, len_ret) { int p = i - ret[j]; if (p < 0) break; if (b[p] == 0) { b[i] = true; break; } } } return b[n] ? "Win" : "Lose"; } int main() { print(solve()); return 0; }