#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <climits>
#include <bitset>
#include <cassert>
#include <random>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

vector<int> prime;
const int N = 20010;
int np[N];

int dp[N];
int rec(int n){
	int &res = dp[n];
	if (res + 1) return res;

	res = 0;
	int idx = 0;
	while (1){
		if (n - prime[idx] < 2) break;
		res |= !rec(n - prime[idx]);
		++idx;
	}

	return res;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	FOR(i, 2, N){
		if (!np[i]){
			for (int j = i * 2; j < N; j += i) np[j] = 1;
			prime.push_back(i);
		}
	}

	int n;
	cin >> n;
	MEMSET(dp, -1);

	cout << (rec(n) ? "Win" : "Lose") << endl;


	return 0;
}