#include using namespace std; //typedef //------------------------------------------ typedef vector VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef long long LL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) //constant //-------------------------------------------- const double EPS = 1e-10; const double PI = acos(-1.0); bool prime[10010]; int win[10010]; vector primes; int iswin(int N, int p = 0){ if(win[N]) return win[N]; for(int x: primes){ if(x > N) break; if(iswin(N-x) < 0 && N-x > 1){ return win[N] = 1; } } return win[N] = -1; } int main(){ cin.tie(0); ios_base::sync_with_stdio(false); int N; cin >> N; fill(prime, prime+10010, true); prime[0] = prime[1] = false; for(int i=2;i*i<=N;++i) if(prime[i]) for(int j=i+i;j<=N;j+=i) prime[j] = false; REP(i,N+1) if(prime[i]) primes.PB(i); win[0] = win[1] = -1; cout << (iswin(N)==1? "Win": "Lose") << endl; return 0; }