#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

#define FOR(i,a,b) for(ll i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair

bool isSosu(int n){
	for(int i = 2;i * i <= n;i++){
		if(n % i == 0) return false;
	}
	return true;
}

int sosu[20000] = {}, num = 0;
int memo[20000][2];

void init(){
	memset(memo, -1, sizeof(memo));
}

bool saiki(int now, bool player){
	if(now <= 1){
		if(player) return false; //負け
		return true;	//勝ち
	}
	if(memo[now][player] != -1) return memo[now][player];

	int *up = upper_bound(sosu, sosu + num, now);
	up--;
	int n = up - sosu;

	bool a, ret;
	if(player){
		ret = true;
	}else{
		ret = false;
	}

	for(int i = 0;i <= n;i++){
		a = saiki(now - sosu[i], !player);
		if(player == true && a == false){
			ret = false;
		}else if(player == false && a == true){
			ret = true;
		}
	}

	return memo[now][player] = ret;
}

int main() {
	init();
	int n;
	cin >> n;
	for(int i = 2;i < 10000;i++){
		if(isSosu(i)){
			sosu[num] = i;
			num++;
		}
	}
	bool ans = saiki(n, 0);
	if(ans) cout << "Win" << endl;
	else cout << "Lose" << endl;
	return 0;
}