#include <bits/stdc++.h>


using namespace std;

typedef long long ll;
typedef long double ld;


#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end())
#define ub(vec,a) upper_bound(vec.begin(),vec.end())
#define uniq(vec) vec.erace(unique(vec.begin(),vec.end(),vec.end))
#define mp1(a,b,c) P1(a,P(b,c))
#define all(x) (x).begin(),(x).end()

#define MAX_N 100100
#define NIL -1

int prime[MAX_N];
bool dp[MAX_N];
bool is_prime(int n){
	for (int i = 2; i*i <= n; i++){
		if (n%i == 0)return false;
	}							  
	return n!=1;//n==1のときのみfalse
}

int main() {
	int n;
	cin >> n;
	//cout << is_prime(n) << endl;
	int p = 0,pn=0;
	for (int i = 2; i <= n; i++){
		if (is_prime(i)){
			prime[p] = i;
			p++;
			pn++;
		}
	}
	//cout << prime[0];
	dp[0] = dp[1] = dp[2] = dp[3] = 0;
	for (int i = 2; i <= n; i++){
		for (p = 0; p <pn ; p++){
			dp[i + prime[p]] = !dp[i] | dp[i + prime[p]];	  
		}
	}
	if (dp[n])cout << "Win" << endl;
	else cout << "Lose" << endl;
	
	return 0;
}