#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#include <iomanip>

#define INF 1000000001
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const double PI = acos(-1.0);

int N, K;
vector<int> primes;

void getprimes(int n)
{
	vector<bool> v(n+1);
	int d=2;
	FOR(d,2,n+1) {
		if (v[d]) continue;
		primes.push_back(d);
		int tmp=d*2;
		while (tmp <= n) {
			v[tmp] = true;
			tmp += d;
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);

	cin >> N;
	getprimes(N);

	vector<bool> win(N+1, false);
	win[0] = win[1] = true;

	FOR(n,2,N+1) {
		bool flg = true;
		FOR(i,0,primes.size()) {
			if (primes[i] > n) break;
			flg &= win[n-primes[i]];
		}
		win[n] = !flg; 
	}

	string ans=(win[N])? "Win" : "Lose";
	cout << ans << endl;

	return 0;
}