#include<iostream>
#include<vector>

using namespace std;

#define NMAX 10000
#define NO -1
#define WIN 0
#define LOSE 1

int main(){

	int N;
	bool hurui[NMAX+1];
	vector<int> primenumber;
	int winlose[NMAX+1]; 

	for(int i=0;i<=NMAX;i++) hurui[i]=true;
	hurui[0]=false;
	hurui[1]=false;

	for(int i=0;i<=NMAX;i++){
		if(hurui[i]){
			primenumber.push_back(i);
			for(int j=i;j<NMAX;j+=i){
				hurui[j]=false;
			}
		}
	}

	for(int i=0;i<=NMAX;i++) winlose[i]=NO;
	winlose[2]=LOSE;
	winlose[3]=LOSE;
	for(int i=0;i<=NMAX;i++){
		if(winlose[i]!=NO){
			for(int j=0;j<primenumber.size();j++){
				if(i+primenumber[j]>NMAX) break;
				if(winlose[i+primenumber[j]]==WIN) continue;
				winlose[i+primenumber[j]]=(winlose[i]==WIN)?LOSE:WIN;
			}
		}
	}

	cin>>N;
	cout<<((winlose[N]==WIN)?"Win":"Lose")<<endl;
}