#include<iostream>
using namespace std;

int dp[10000], i, j;

int prime(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 a = 0, b = 0, x = 0;

	for (i = 0; i < n; i++)
	{
		for (j = n - i - 1; j > 0; j--)
		{
			if ((n - i) % j == 0)
			{
				a++;
			}

			if (a > 1)
			{
				break;
			}
		}

		if (a == 1)
		{
			b++;

			if (prime(i) == 0)
			{
				x++;
			}
		}

		a = 0;
	}

	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) == 1)
	{
		cout << "Lose" << endl;
	}

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

}