#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

typedef long long ll;
using namespace std;

#define mod 1000000007
#define INF 1000000000
#define LLINF 2000000000000000000LL

#define SIZE 200000

int n;
int dp[10001];
int ans=0;
vector<int> pnum;

const int MAX_P = 10100;
bool prime[MAX_P+1];
void primen(void){
    for(int i=2;i<=MAX_P;i++)
        prime[i]=true;
    
    for(int i=2;i*i<=MAX_P;i++)
        if(prime[i]){
            for(int j=i;i*j<=MAX_P;j++)
                prime[i*j]=false;
        }
    
}


int main(){
    
    scanf("%d",&n);
    
    primen();
    
    for(int i=2;i<=n+100;i++){
        if(prime[i])
            pnum.push_back(i);
    }
    
    dp[0]=dp[1]=-1;
    dp[2]=dp[3]=0;
    
    for(int i=4;i<=n;i++){
        vector<int> vec;
        
        for(int j=0;pnum[j]<=i-2;j++){
            vec.push_back(dp[i-pnum[j]]);
        }
        
        sort(vec.begin(),vec.end());
        
        int c=0;
        
        if(vec[0]>0){
            dp[i]=0;
            continue;
        }
        
        while(c<vec.size()-1){
            if(vec[c]+1>=vec[c+1])
                c++;
            else
                break;
        }
        
        dp[i]=vec[c]+1;
        
    }
    
    if(dp[n]==0)
        puts("Lose");
    else
        puts("Win");
    
    return 0;
}