#include <bits/stdc++.h> 

using i64 = long long; 
using u64 = unsigned long long; 
using u32 = unsigned; 

using u128 = unsigned __int128; 
using i128 = __int128; 

void solve() {
	std::vector<int> primes;
	std::vector<bool> isPrime(10001, true);

	isPrime[0] = isPrime[1] = false;

	for(int i = 2; i <= 10000; i ++) {
		if (isPrime[i]) {
	        primes.push_back(i);
	        for (int j = i * i; j <= 10000; j += i) {
	            isPrime[j] = false;
	        }
    	}
	}

	int N;
	std::cin >> N;

	std::vector<bool> dp(N + 1);

	for(int i = 4; i <= N; i ++) {
		dp[i] = false;

		for(auto p : primes) {
			if(p > i) break;

			int q = i - p;

			if(q <= 1) continue;

			if(!dp[q]) {
				dp[i] = true;
				break;
			}
		}
	}

	if(dp[N]) std::cout << "Win\n";
	else std::cout << "Lose\n";
} 

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

	int T = 1; 
	//std::cin >> T; 

	while (T--) { 
		solve(); 
	} 
	return 0; 
}