#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
bool isp[1 << 14];
vector<int> p;
bool chked[1 << 14];
bool ans[1 << 14];
int len;
void init() {
	fill(isp + 2, isp + (1 << 14),true);
	Rep(i, 2, (1 << 14)) {
		if (!isp[i])continue;
		p.push_back(i);
		for (int j = 2 * i; j < (1<<14); j += i) {
			isp[j] = false;
		}
	}
	chked[0] = chked[1] = true;
	ans[0] = ans[1] = true;
	len = p.size();
}
bool dfs(int n) {
	if (chked[n])return ans[n];
	bool res = false;
	rep(i, len) {
		if (p[i] > n)break;
		if (!dfs(n - p[i])) {
			res = true; break;
		}
	}
	chked[n] = true;
	return ans[n] = res;
}
int n;
int main(){
	cin >> n;
	init();
	if (dfs(n))cout << "Win" << endl;
	else cout << "Lose" << endl;
	return 0;
}