#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

bool np[10001];
vector<int> primes;
bool win[10001];

int main(int argc, char **argv) {
	int N;
	cin >> N;
	CLEAR(np);
	np[0] = np[1] = true;
	for (int i = 2; i <= N; ++i) {
		if (np[i]) continue;
		primes.push_back(i);
		for (int j = i * 2; j <= N; j += i) np[j] = true;
	}
	CLEAR(win);
	win[2] = win[3] = false;
	FOR(i, 4, N + 1) {
		win[i] = false;
		REP(j, primes.size()) {
			if (i - primes[j] < 2) break;
			if (!win[i - primes[j]]) {
				win[i] = true;
				break;
			}
		}
	}
	cout << (win[N] ? "Win" : "Lose") << endl;
	return 0;
}