#include <iostream>
#include <iomanip>

#include <algorithm>
#include <math.h>

#include <string>
#include <list>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
const int numMax = 10001;
int num = 0;
int prim[numMax];
int dp[numMax];

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed;//
    //cout << setprecision(6);//
	
	int N;
	cin>>N;//[2,10000=10^4]
	
	prim[0] = 2;
	++num;
	for(int i=3;i<numMax;++i){
		int j;
		for(j=0;j<num;++j){
			if(i%prim[j] == 0){
				break;
			}
		}
		if(j==num){
			prim[num] = i;
			++num;
		}
	}
	
	rep(i,numMax){
		dp[i] = -1;
	}

	dp[0] = 0;
	dp[1] = 0;
	dp[2] = 1;
	dp[3] = 1;

	int ans = 0;
	
	for(int i=2;i<numMax;++i){
		int temp  = 0;
		int count = 0;
		for( int k = 0 ; prim[k] <= i && k < num ; ++k){//
			++temp;
			if( dp[i-prim[k] ] == 1){
				dp[i] = 0;
				break;
			}
			else{
				++count;
			}
		}
		if(temp == count){
			dp[i] = 1;
		}
	}
	
	ans = dp[N];

	if(ans == 0){
		P("Win");
	}else{
		P("Lose");
	}
	return 0;
}