#include <iostream> 
#include <string> 
#include <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 
#include <cctype>
#include <queue>

using namespace std; 

typedef pair<int,int> pii;
const int INF=(1<<30);


int f(long x){
	int sum=0;
	while(x){
		sum+=x%10;
		x/=10;
	}

	if(sum<10) return sum;
	else return f(sum);

}

vector<long> get_Prime(long K,long N){
	vector<bool> prime(N+1,true);
	prime[0]=prime[1]=false;

	for(long i=2;i*i<=N;i++){
		if(prime[i]){
			for(int j=2;i*j<=N;j++) prime[i*j]=false;
		}
	}

	vector<long> res;
	for(long i=K;i<=N;i++) if(prime[i]) res.push_back(i);

	return res;

}


int main(){

	long N;
	cin>>N;

	vector<long> prime=get_Prime(0,N);
	vector<long> is_kachi(N+1,false);

	//必要
	is_kachi[0]=is_kachi[1]=true;
	is_kachi[4]=true;


	for(long i=5;i<=N;i++){
		for(int j=0;prime[j]<=i && j<prime.size();j++){
			if(!is_kachi[i-prime[j]]){
				is_kachi[i]=true;
			}
		}
	}


	if(is_kachi[N]) cout<<"Win"<<endl;
	else cout<<"Lose"<<endl;

	return 0;
}