#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;
int which[10000];
bool prime[10000];

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 (which[n] >= 0) {
		return which[n];
	}
	int ret = 0;
	for (int i = 0; i <= n; i++) {
		if (prime[i]) {
			if (Solve(n - i) == 0)
				ret = 1;
		}
	}
	return which[n] = ret;
}

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