#include<stdio.h>
int prime[10001],check[10001];

char* solve(int n){
	int i,j;
	prime[0]=1;
	prime[1]=1;
	for(i=2;i<=n;i++){
		if(prime[i]==0){
			for(j=i+i;j<=n;j+=i) prime[j]=1;
		}
	}
	for(i=2;i<=n;i++){
		for(j=2;j<i-1;j++){
			if(prime[j]==0){
				if(check[i-j]==0){
					check[i]=1;
					break;
				}
			}
		}
	}
	if(check[n]) return "Win\n";
	return "Lose\n";
}


int main(){
	int n;
	scanf("%d",&n);
	printf("%s",solve(n));
	return 0;
}