#include <bits/stdc++.h>
using namespace std;

const int N = 10005;
bool is_prime[N];
void find_primes(int n)
{
	fill(is_prime, is_prime + N, true);
	is_prime[0] = is_prime[1] = false;
	for(int i = 2; i <= n; i++) {
		if(is_prime[i]) {
			for(int j = 2; j * i <= n; j++) {
				is_prime[j * i] = false;
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n; cin >> n;
	vector<bool> winning(n + 1);
	fill(winning.begin(), winning.end(), false);
	find_primes(n);
	winning[0] = winning[1] = true;
	for(int i = 2; i <= n; i++) {
		for(int j = 2; j <= i; j++){
			if(is_prime[j] && !winning[i - j]) winning[i] = true;			
		}
	}
	if(winning[n]) cout << "Win" << endl;
	else cout << "Lose" << endl;
	
	
	return 0;	
}