#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;

int main(){
    int N;cin>>N;
    vector<int> p;
    vector<bool> sieve(N+1,true);
    rep(i,2,N+1){
        if(sieve[i]){
            REP(j,N/i+1) sieve[i*j]=false;
            p.push_back(i);
        }
    }
    vector<int> win(N+1,0);
    rep(i,2,N+1){
        if(win[i]==0) REP(j,p.size()){
            if(p[j]+i>N) break;
            win[p[j]+i]=1;
        }
    }
    if(win[N]) cout<<"Win"<<endl;
    else cout<<"Lose"<<endl;
}