#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
typedef long long ll;
const ll ccc=10000;
bool prime[ccc+1];
vector<ll> pr;
void makeprime(){
	ll i,j;
	for(i=2;i<=ccc;i++) prime[i]=true;
	for(i=2;i*i<=ccc;i++) if(prime[i]) for(j=2;j*i<=ccc;j++) prime[j*i]=false;
	for(i=2;i<=ccc;i++) if(prime[i]) pr.push_back(i);
}
int g[10001];
int main(){
	makeprime();
	int N;
	cin>>N;
	for(int i=2;i<=N;i++){
		set<int> st;
		for(int p:pr){
			if(i-p<2) break;
			st.insert(g[i-p]);
		}
		int v=0;
		while(binary_search(all(st),v)) v++;
		g[i]=v;
	}
	if(g[N]) puts("Win");
	else puts("Lose");
}