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

bool prime(int n)
{
	if (n < 2)
		return false;

	for (int i = 2; i <= sqrt(n); ++i)
	{
		if (n % i == 0)
			return false;
	}
	return true;
}

bool dfs(int n, bool f, int counter)
{
	if (n < 4) return counter % 2 == 0 ? f : !f;

	int flag = false;
	for (int i = 2; 1 < n - i; ++i)
	{
		if (prime(n - i))
		{
			if (!dfs(i, !f, counter + 1))
				return true;
		}
	}

	return false;
}

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

	cout << (dfs(res, false, 0) ? "Win" : "Lose") << endl;

	return 0;
}