#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 i = 0;
    while(P[i] > N) i++;

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

int main(){    
    cin >> N;
    prime( N );
    cout <<  ( dfs( 0, N ) ? "Win" : "Lose" ) << endl;    
    return 0;
}