#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;
bool isPrime(long a){
	if(a<2) return false;
	for(int i=2;i*i<=a;i++){
		if(a%i==0) return false;
	}
	return true;
}

int main(){
	vector<int> p;
	int N; cin>>N;
	REP(i,N) if(isPrime(i+1)) p.push_back(i+1);
	vector<bool> dp(N+1,false);
	dp[0]=true; dp[1]=true;
	FOR(i,2,N+1){
		REP(j,p.size()){
			if(i<p[j]) break;
			dp[i]=dp[i]|(!dp[i-p[j]]);
		}
	}
	string s;
	if(dp[N]) s="Win";
	else s="Lose";
	cout<<s<<endl;
}