#include "bits/stdc++.h"
using namespace std;

typedef long long Int;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);++(i))

const int MAX_N = 10000 + 10;
bool is_prime[MAX_N];
vector<int> primes;

int memo[MAX_N];
const int WIN = 1;
const int LOSE = 2;

int solve(int n) {
	if (memo[n] != 0) return memo[n];
	if (n == 0 || n == 1) return WIN;
	int res = LOSE;
	for (int i = 0; primes[i] <= n; i++) {
		if (LOSE == solve(n - primes[i])) {
			res = WIN;
		}
	}
	return memo[n] = res;
}

int main() {

	for (int i = 0; i < MAX_N; i++) is_prime[i] = true;
	is_prime[0] = is_prime[1] = false;
	for (int i = 2; i * i <= MAX_N; i++) {
		if (is_prime[i]) {
			for (int j = i * i; j < MAX_N; j += i) {
				is_prime[j] = false;
			}
		}
	}
	for (int i = 0; i < MAX_N; i++) if (is_prime[i]) primes.push_back(i);

	int n;
	cin >> n;
	cout << (solve(n) == WIN ? "Win" : "Lose") << endl;
}