#include <bits/stdc++.h>
using namespace std;

int N,M;
int P[10010];

void prime(int N){
    for(int i= N ; i>=2; i--){
        bool flag = true;
        for( int j = 2; j * j <= i; j++){
            if( i % j == 0 ){
                flag = false;
                break;
            }
        }
        if(flag) P[M++]=i;
    }
}

bool dfs( const int T, const int N){
    if( N <= 1) return T^1;
    int low = 0, high= M;
    
    while(high-low>1){
        const int mid=(low+high)/2;
        if(P[mid] > N)
            low=mid;
        else
            high=mid;
    }

    int i = high;
    
    while(i < M ){
        int x = P[i++];
        if(T^dfs(T^1, N - x )) return T^1;
    }

    return T;
}

int main(){    
    scanf("%d",&N);
    prime( N );
    puts(dfs(0, N)? "Win" : "Lose" );
    return 0;
}