#include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
#include<cassert>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
using namespace std;
typedef pair<int,int>pint;
typedef vector<int>vint;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

vint prime;
bool f[10101];

int N;

int memo[2][10101];

bool calc(int p,int n){
    if(n<=1)return true;
    if(~memo[p][n])return memo[p][n];

    int u=upper_bound(prime.begin(),prime.end(),n)-prime.begin();

    bool ret=false;
    rep(i,u)ret|=(!calc(!p,n-prime[i]));

    return memo[p][n]=ret;
}

int main(){
    fill_n(f,10101,true);
    f[0]=f[1]=false;
    for(int i=2;i<10101;i++){
        if(!f[i])continue;
        prime.pb(i);
        for(int j=2;i*j<10101;j++)f[i*j]=false;
    }

    cin>>N;
    memset(memo,-1,sizeof(memo));

    if(calc(1,N))cout<<"Win"<<endl;
    else cout<<"Lose"<<endl;

    return 0;
}