#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
#include<functional>
using namespace std;

bool prime[10001];
vector<int> prime_list;
int gr[10001];

int main(void){
	int N;
	cin >> N;
	for (int i = 0; i <= N; i++)
	{
		prime[i] = true;
	}
	prime[0] = prime[1] = false;
	for (int i = 0; i <= N; i++)
	{
		if (prime[i]){
			for (int j = (i << 1); j <= N; j += i)
			{
				prime[j] = false;
			}
			prime_list.push_back(i);
		}
	}

	gr[0]=gr[1]=gr[2] =gr[3]= 0;
	

	for (int i = 4; i <=N; i++)
	{
		set<int> g;
		for (auto &x : prime_list){
			if (i - x < 2)break;
			g.insert(gr[i - x]);
		}
		int now=0;
		for (auto &x : g){
			if (x!=now)break;
			now++;
		}
		gr[i] = now;
		//cout << i << " " << gr[i] << endl;
	}
	if (gr[N])cout << "Win" << endl;
	else cout << "Lose" << endl;
	return 0;
}