#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={1,0,-1,0,1,1,-1,-1}; const ll dx[8]={0,-1,0,1,1,-1,1,-1}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a <= b) { a = b; return true; } return false; } vector sieve(int N){ vector is_prime(N+1,true); vector P; for(int i=2;i<=N;i++){ if(is_prime[i]){ for(int j=2*i;j<=N;j+=i)is_prime[j] = false; P.emplace_back(i); } } return P; } int main(){ ll n;cin >> n; vector dp(n+1); dp[0]=1;dp[1]=1; repl(i,2,n+1){ vl p=sieve(i); set st; for(auto x:p){ st.ins(dp[i-x]); } rep(j,10000){ if(!st.count(j)){ dp[i]=j; break; } } } cout << (dp[n]? "Win":"Lose") <