#include <iostream>
#include <vector>
using namespace std;

#define N_MAX 10000

int N;
int isnotprime[N_MAX + 1];
vector<int> prime;
bool dp[N_MAX + 1];

void make_prime() {
	isnotprime[0] = isnotprime[1] = 1;
	for (int i = 2; i * i <= N_MAX; i++) {
		if (!isnotprime[i]) {
			for (int j = i * i; j <= N_MAX; j += i) {
				isnotprime[j] = 1;
			}
		}
	}
	for (int i = 2; i <= N_MAX; i++) if (!isnotprime[i]) prime.push_back(i);
}

int main() {
	make_prime();
	
	dp[0] = dp[1] = 1;
	for (int i = 2; i <= N_MAX; i++) {
		for (int& p : prime) {
			if (i < p) break;
			if (!dp[i - p]) {
				dp[i] = 1;
				break;
			}
		}
	}
	
	cin >> N;
	cout << (dp[N] ? "Win" : "Lose") << '\n';
	
	return 0;
}