#include <iostream>
#include <set>
using namespace std;
int N;

bool so[10001];
int mem[10001];

int grundy(int n) {
	if (mem[n] != -1)return mem[n];

	set<int> s;
	for (int i = 2; i <= n; i++) {
		if (!so[i] && n - i > 1) s.insert(grundy(n - i));
	}
	int res = 0;
	while (s.count(res)) res++;
	return mem[n] = res;
}

int main()
{
	cin >> N;

	for (int i = 2; i <= 10000; i++) {
		if (!so[i]) {
			for (int j = i * 2; j <= 10000; j += i) so[j] = true;
		}
	}
	for (int i = 0; i < 10001; i++) mem[i] = -1;

	if (grundy(N)) {
		cout << "Win" << endl;
	}
	else {
		cout << "Lose" << endl;
	}

	return 0;
}