#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>

using namespace std;

int N;
int flag[10001];
bool prime[10001];

bool check(int num) {
	int i;
	bool ret = false;

	if (num <= 1) return false;

	if (flag[num] == 1) return true;
	if (flag[num] == -1) return false;

	for (i = 2; i < num-1 && !ret; i++) {
		if (!prime[i]) {
			if (!check(num-i)) ret = true;
		}
	}

	if (ret) flag[num] = 1;
	else flag[num] = -1;

	return ret;
}

int main() {
	int i, j;

	cin >> N;

	for (i = 2; i <= 10000; i++) {
		if (!prime[i]) {
			for (j = 2*i; j <= 10000; j += i) {
				prime[j] = true;
			}
		}
	}

	if (check(N)) cout << "Win" << endl;
	else cout << "Lose" << endl;

	return 0;
}