#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1'000'000'007;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

// エラトステネスの篩
// O(n log log n)
// Verified: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3452809
vector<bool> eratos(int n) {
	vector<bool> is_prime(n + 1, true);
	is_prime[0] = is_prime[1] = false;
	for (int i = 2; i*i <= n; i++) {
		if (!is_prime[i])continue;
		for (int j = i * i; j <= n; j += i)
			is_prime[j] = false;
	}
	return is_prime;
}

// n以下の素数
// O(n log log n)
vector<int> getPrimes(int n) {
	vector<bool> is_prime = eratos(n);
	vector<int> primes;
	for (int i = 0; i <= n; i++)
		if (is_prime[i])
			primes.push_back(i);
	return primes;
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N; cin >> N;
	vector<int> primes = getPrimes(N);
	vector<int> g(N + 1);
	g[0] = 1;
	g[1] = 1;
	rep(i, 2, N + 1) {
		set<int> st;
		for (auto p : primes) {
			if (i - p < 0)break;
			st.insert(g[i - p]);
		}
		int c = 0;
		for (auto x : st) {
			if (x == c)
				c++;
			else
				break;
		}
		g[i] = c;
	}
	dump(g);
	if (g[N]) {
		cout << "Win" << endl;
	}
	else {
		cout << "Lose" << endl;
	}
	return 0;
}