#include <stdio.h>
int prime[10001];
int p[5000];
int dp[10001];
int is_prime(int x){
  int i;
  for(i=2;i*i<=x;i++){
    if(x%i==0)return 0;
  }
  return 1;;
}
int main(){
  int n;
  int i,j,pcount=0;
  scanf("%d",&n);
  for(i=2;i<=n;i++){
    if(is_prime(i)) {
      prime[i]=1;
      p[pcount]=i;
      pcount++;
    }
  }
  //for(i=0;i<pcount;i++)printf("%d ",p[i]);
  dp[0]=1;
  dp[1]=1;
  for(i=2;i<=n;i++){
    j=0;
    while(p[j]<=i && j < pcount){
      if(dp[i-p[j]]==0){dp[i]=1;
	//printf("%d %d\n",i,p[j]);
      }
      j++;
    }
  }
  // for(i=0;i<=n;i++)printf("%d ",dp[i]);
  if(dp[n]==1)printf("Win\n");
  else printf("Lose\n");
  return 0;
}