#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cmath>

#define ll long long

using namespace std;

int prime[10000];
int cnt=0;
int WL[10001]={0};

void Eratosthenes(int N){
    
    int arr[10000];

	for(int i = 0; i < N; i++) arr[i] = 1;
	
	for(int i = 2; i < sqrt(N); i++)
		if(arr[i]){
			for(int j = 0; i * (j + 2) < N; j++){
				arr[i *(j + 2)] = 0;
			}
	    }

	for(int i = 2; i < N; i++)
		if(arr[i]) prime[cnt++]=i;
}

int main(){
  
   int n;
   cin>>n;
   Eratosthenes(10000);
   
   WL[0]=WL[1]=1;
   WL[2]=WL[3]=0;
   for(int i=4;i<=10000;++i){
       for(int j=0;j<cnt;++j){
           if(i-prime[j]<0) break;
           if(!WL[i-prime[j]]){
               WL[i]=1;
               break;
           }
       }
   }
    
   if(WL[n]) cout<<"Win"<<endl;
   else cout<<"Lose"<<endl;

   return 0;
}