#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <cstring>

using namespace std;
vector<int> winTable;
vector<int> prime;

bool IsPrime(int n) {
	if (n == 2) return true;
	if (n % 2 == 0)  return false;
	int lim = n / 2;
	for (int i = 2; i < lim; i++) {
		if (n % i == 0) return false;
	}
	return true;
}

bool Solve(int n) {
	if (winTable[n] != -1) {
		return winTable[n];
	}
	int ret = 0;
	for (int i = 0; i < prime.size(); i++) {
		if (prime[i] <= n) {
			if (!Solve(n - prime[i])) {
				ret = 1;
			}
		}
	}
	return winTable[n] = ret;
}

int main(void) {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	int N;
	cin >> N;
	for (int i = 2; i <= N; i++) {
		if (IsPrime(i))
			prime.push_back(i);
	}
	for (int i = 0; i <= N; i++) {
		winTable.push_back(-1);
	}
	winTable[0] = winTable[1] = 1;
	Solve(N);
	cout << (winTable[N] ? "Win" : "Lose") << endl;
}