#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

bool iswin[10005];
int main() {
	vector<int> prime;
	int n;
	cin >> n;
	prime.push_back(2);
		for (int i = 3; i <= n; i++) {
			for (int j = 0; j < prime.size(); j++) {
				if (i % prime[j] == 0)break;
				if (j == prime.size() - 1) prime.push_back(i);
			}
		}
		iswin[0] = iswin[1] = true;
		for (int i = 2; i <= n; i++) {
			iswin[i] = false;
			for (int j = 0; j < prime.size(); j++) {
				if (prime[j] > i) break;
				if (!iswin[i - prime[j]]) {
					iswin[i] = true; break;
				}
			}
		}
		if (iswin[n]) cout << "Win\n";
		else cout << "Lose\n";
		return 0;
}