#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <functional>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
using ll = unsigned long long;
const ll mod = 1000000007;
const int M_MAX = 10000;
string al = "abcdefghijklmnopqrstuvwxyz";
//bool less_sec(const pair<int, int>&a, const pair<int, int>&b) {
//	return a.second > b.second;
//}
// << 左シフト(値が大きくなる(*‘ω‘ *))
// >> 右シフト
// 0xFFFFFFFC
bool flag = true;
vector<int> prime;
void dfs(int cnt, int v) {
	if (v < 0) return;
	if (v == 0 || v == 1) {
		if (cnt % 2 == 0) flag = false;
		return;
	}
	for (int i = 0; i < prime.size(); ++i) {
		dfs(cnt + 1, v - prime[i]);
	}
}
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n; cin >> n;
	prime.push_back(2);
	for (int i = 3; i < n; i += 2) {
		bool judge = true;
		for (int j = 2; j*j <= i; ++j) {
			if (i%j == 0) {
				judge = false;
				break;
			}
		}
		if (judge) prime.push_back(i);
	}
	for (int i = 0; i < prime.size(); ++i) {
		dfs(0, n - prime[i]);
	}
	if (flag) cout << "Win" << endl;
	else cout << "Lose" << endl;
	return 0;
}