#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;
/////////
int num = 0;
int prim[10001];
int dp[2][10001];

int solve(int t,int nowN){//スタックオーバーフロー
	int ans = -1;

	if(dp[t][nowN] != -1){
		ans = dp[t][nowN];
	}
	else{
		int tempans;
		for(int i=0;i<num;++i){
			if(prim[i] <= nowN){
				if( nowN-prim[i] == 0 || nowN-prim[i] == 1){
					tempans = (t+1)%2;
				}else{
					tempans = solve((t+1)%2,nowN-prim[i]);
				}
			}else{
				tempans = -1;
			}
			if(tempans != -1 ){
				if(tempans == t){
					dp[t][nowN] = t;
					ans = t;
					break;
				}else{
					ans = (t+1)%2;
				}
			}
		}
		dp[t][nowN] = ans;
	}
	return ans;
}
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<10001;++i){
		int j;
		for(j=0;j<num;++j){
			if(i%prim[j] == 0){
				break;
			}
		}
		if(j==num){
			prim[num] = i;
			++num;
		}
	}
	
	rep(i,10001){
		dp[0][i] = -1;
		dp[1][i] = -1;
	}

	dp[0][0] = 0;
	dp[0][1] = 0;
	dp[1][0] = 1;
	dp[1][1] = 1;

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

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

	int ans = 0;
	
	for(int i=2;i<10001;++i){
		//dp[0][i];について調べる
		int temp  = 0;
		int count = 0;
		for( int k = 0 ; prim[k] <= i ; ++k){//&& ( i - prim[k] ) >= 0
			++temp;
			if( dp[1][i-prim[k] ] == 0){
				dp[0][i] = 0;//勝ち
				dp[1][i] = 1;
				break;
			}
			else{
				++count;
			}
		}
		if(temp == count){
			dp[0][i] = 1;
			dp[1][i] = 0;
		}
	}
	
	ans = dp[0][N];

	if(ans == -1){
		ans = solve(0,N);
	}

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