#include"bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,m,n) for(ll i=(ll)m;i<(ll)n;i++)
#define Endl endl
#define pr(i,j) make_pair(i,j) 
const ll mod = 998244353;
const ll inf = 5e18;
const ld pi = 3.14159265358979;
bool is_prime(ll n) {
	if (n == 1)return false;
	for (ll i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
int main() {
	ll n;
	cin >> n;
	vector<ll>p;
	rep(i, 1, n + 1) {
		if (is_prime(i))p.push_back(i);
	}
	vector<ll>ar(n + 1);
	ar[0] = 1;
	ar[1] = 1;
	rep(i, 2, n + 1) {
		bool f = false;
		rep(j, 0, p.size()) {
			if (p[j] > i)break;
			if (ar[i - p[j]] == 0)f = true;
		}
		ar[i] = f;
	}
	if (ar[n])cout << "Win" << endl;
	else cout << "Lose" << endl;
}