#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <iomanip>
#include <numeric>
#include <memory>
#include <limits.h>
#include <set>
#include <cassert>
#include <cmath>
#include <bitset>
using namespace std;

typedef long long ll;

#define REP(i,n) for(ll i=0; i<(n); ++i)
#define TEN(x) ((ll)1e##x)
#define ALL(v) (v).begin(), (v).end()

// エラトステネスのふるい O(n log log n) : t[i] = true ⇔ iが素数 (i <= n)
vector<int> sieve_of_eratosthenes(ll n) {
	vector<int> t(n+1, true); t[0] = t[1] = false;
	for(ll i = 2; i <= n; ++i) if (t[i]){
		for(ll j = 2*i; j <= n; j += i) t[j] = false;
	}
	return t;
}

int main() {
	ll n;
	cin >> n;

	auto t = sieve_of_eratosthenes(n);
	vector<ll> v; v.reserve(n);
	REP(i, n + 1) if (t[i]) v.push_back(i);

	vector<bool> win(n + 1, true);
	for (ll i = 2; i < n + 1; ++i) win[i] = !all_of(ALL(v), [&](ll x) { return i < x || win[i-x]; });
	std::cout << (win[n] ? "Win" : "Lose") << endl;
	return 0;
}