#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define MAX 1e18
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  ll N;cin>>N;vector<bool>A(N+1,0),prime(N+1,1);A[0]=1;A[1]=1;;prime[0]=0;prime[1]=0;
  FOR(i,2,N+1){ll k=2;while(k*k<=i){if(i%k==0)prime[i]=0;k++;}}
  FOR(x,2,N+1)REP(i,x)if(prime[i]&&!A[x-i])A[x]=1;
  if(A[N])cout<<"Win"<<endl;else cout<<"Lose"<<endl;
  return 0;
}