#include <iostream>
#include <cstdint>
#include <vector>

using namespace std;

int main()
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	uint16_t N, i, j, prime_count = 0, primes[9999];
	bool is_prime[10001], can_first_win[10001];
	cin >> N;

	is_prime[0] = is_prime[1] = false, can_first_win[0] = can_first_win[1] = true;
	for (i = 2; i <= N; ++i) is_prime[i] = true;

	for (i = 2; i <= N; ++i)
	{
		for (j = 0; j != prime_count; ++j)
			if (!can_first_win[i - primes[j]]) break;
		can_first_win[i] = (j != prime_count);

		if (is_prime[i])
		{
			primes[prime_count] = i, ++prime_count;
			if (i <= 100)
				for (j = i * i; j <= N; j += i)
					is_prime[j] = false;
		}
	}

	if (can_first_win[N]) cout << "Win\n";
	else cout << "Lose\n";
	return 0;
}