#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl


// 素数かどうかの表を計算
// Eratosthenes の篩 : O( N log log N )
vector<bool> eratosthenes( const int N )
{
	vector<bool> isPrime( N + 1, true );
	isPrime[0] = isPrime[1] = false;

	for ( int i = 0; i <= N; i++ )
	{
		if ( !isPrime[i] )
		{
			continue;
		}

		for ( int j = 2; i * j <= N; j++ )
		{
			isPrime[ i * j ] = false;
		}
	}

	return isPrime;
}

// N 以下の素数のリストを生成する
// include : eratosthenes
vector<int> getPrimes( const int N )
{
	vector<bool> isPrime = eratosthenes( N );
	vector<int> result;
	result.reserve( count( isPrime.begin(), isPrime.end(), true ) );
	for ( int i = 0; i <= N; i++ )
	{
		if ( isPrime[i] )
		{
			result.push_back( i );
		}
	}
	return result;
}

const auto Primes = getPrimes( 10'000 );

bool solve( const int T, const int N )
{
	static VVI memo( 2, VI( N + 1, -1 ) );
	int &res = memo[T][N];

	if ( res != -1 )
	{
		return res;
	}

	if ( N <= 1 )
	{
		return 1 - T;
	}

	using ftype = function< int( int, int ) >;
	const auto f = T ? ftype( logical_and< int >() ) : ftype( logical_or< int >() );
	res = T;

	FOR( p, Primes )
	{
		if ( N - p < 0 )
		{
			continue;
		}

		res = f( res, solve( 1 - T, N - p ) );
	}

	return res;
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	int N;
	cin >> N;

	cout << ( solve( 0, N ) ? "Win" : "Lose" ) << endl;

	return 0;
}