#include <iostream>
#include <vector>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

void getPrimeNumbers(vector<int> & v, int n) {
	vector<bool> search(n + 1, true);
	for (int i = 2; i <= n; i++) {
		if (search[i] && i <= (int)sqrt(n)) {
			v.push_back(i);
			for (int j = i * 2; j <= n; j += i) {
				search[j] = false;
			}
		}
		else if (search[i]) {
			v.push_back(i);
		}
	}
}

int main() {
	int n;
	cin >> n;

	vector<int> primes;
	getPrimeNumbers(primes, n);

	vector<bool> dp(n + 1, false);
	dp[0] = true;
	dp[1] = true;
	for (int i = 2; i <= n; i++) {
		for (int p : primes) {
			if (p > i) {
				break;
			}
			if (!dp[i - p]) {
				dp[i] = true;
				break;
			}
		}
	}

	if (dp[n]) {
		cout << "Win\n";
	}
	else {
		cout << "Lose\n";
	}

	return 0;
}