#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool is_prime(int n){
	for(int i=2;i*i <= n; i++){
		if(n%i == 0)return false;
	}
	return n != 1;
}
int main(void) {
	int n;
	cin >> n;
	vector<int> pn;
	for(int i=2;i<=n;i++){
		if(is_prime(i))pn.push_back(i);
	}

	vector<bool> dp(20002);
	dp[0] = dp[1] = dp[2] = dp[3] = false;
	for(int i=2;i<=10000;i++){
		for(int j=0;j<pn.size();j++){
			dp[i+pn[j]] = !dp[i] | dp[i+pn[j]];
		}
	}
	cout << (dp[n]?"Win":"Lose") << endl;
	return 0;
}