#include<iostream>
using namespace std;

int p[10000], dp[10000], i, j;

void prime(int n)
{
	for (i = 0; i < n; i++)
	{
		p[i] = 1;
	}

	p[0] = 0; 

	for (i = 2; i < n / 2; i++)
	{
		for (j = 2; i * j <= n; j++)
		{
			if (p[i * j - 1] == 1)
			{
				p[i * j - 1] = 0;
			}
		}
	}
}

int prime_n(int n)
{
	if (n == 0 || n == 1)
	{
		return dp[n] = 0;
	}

	if (n == 2 || n == 3)  
	{
		return dp[n] = 1;
	}

	if (dp[n] >= 0)
	{
		return dp[n];
	}

	int b = 0, x = 0;

	prime(n);

	for (i = 0; i < n ; i++)
	{
		if (p[i] == 1)
		{
			b++;

			if (prime_n(n - i - 1) == 1)
			{
				break;
			}

			else
			{
				x++;
			}
		}
	}

	if (b == x)
	{
		return dp[n] = 1;
	}

	else
	{
		return dp[n] = 0;
	}
}

int main()
{
	int n;

	cin >> n;

	if (n == 2 || n == 3)
	{
		cout << "Lose" << endl;

		return 0;
	}

	for (i = 0; i < 10000; i++)
	{
		dp[i] = -1;
	}

	if (prime_n(n) == 1)
	{
		cout << "Lose" << endl;
	}

	else
	{
		cout << "Win" << endl;
	}

}