#include <iostream>
#include <array>
#include <map>
#include <algorithm>
#include <cmath>
#include <vector>
#include <fstream>
#include <string>
#include <random>
#include <queue>
#include <iomanip>
#include <functional>
#include <climits>

using namespace std;

using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = std::vector<ll>;
using vpll = std::vector<pll>;
using vpii = std::vector<pii>;
using vi = std::vector<int>;

const ll mod197 = 1000000007LL;
const ll INF = INT_MAX;

const double PI11 = 3.14159265359;

vi prime;
int desk[10010] = {};
int memo[10010][2] = {};


//勝利条件2,3を作る。
int solve(int i,int depth) {

	if (memo[i][depth % 2] != -1) {
		return memo[i][depth % 2];
	}

	if (i == 0 || i == 1) {
		return depth;
	}

	if (i == 2 || i == 3) {
		return depth-1;
	}

	int res = 0;

	int j = 0;
	while (i >= prime[j]) {

		res = solve(i - prime[j], depth + 1);

		if (depth % 2 == 0) {
			if (res % 2 == 0) {
				return memo[i][depth % 2] = res;
			}
		}
		else {
			if (res % 2 == 1) {
				return memo[i][depth % 2] = res;
			}
		}
		j++;
	}

	return memo[i][depth % 2] = res;
}

void enum_prime() {

	for (int i = 2; i <= 10000; i++) {
		if (desk[i] == false) {
			for (int j = i; j <= 10000; j += i) {
				desk[j] = true;
			}
			prime.push_back(i);
		}
	}

}

int main() {

	enum_prime();
	int n;
	cin >> n;

	fill(memo[0], memo[0] + 10010, -1);
	fill(memo[1], memo[1] + 10010, -1);

	if (solve(n,0) % 2 == 0) {
		cout << "Win" << endl;
	}
	else {
		cout << "Lose" << endl;
	}


	return 0;
}