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

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

	vector<int> search_nums(n + 1);
	search_nums[0] = 0;
	search_nums[1] = 0;
	fill(search_nums.begin() + 2, search_nums.end(), 1);

	vector<int> primes;
	for (int i = 2; i < search_nums.size(); i++) {
		if (search_nums[i] == 1) {
			primes.push_back(i);
			for (int j = i; j < search_nums.size(); j += i) {
				search_nums[j] = 0;
			}
		}
	}
	
	vector<int> dp(n + 1);
	dp[0] = 1;
	dp[1] = 1;
	fill(dp.begin() + 2, dp.end(), 0);
	for (int i = 2; i < dp.size(); i++) {
		for (int j = 0; j < primes.size(); j++) {
			if (primes[j] > i) break;
			if (dp[i - primes[j]] == 0) {
				dp[i] = 1;
				break;
			}
		}
	}

	string ans = dp[n] ? "Win" : "Lose";
	cout << ans << endl;

	return 0;
}