#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
using namespace std;


#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
/* ここからが本編 */
/* */
/* 入力開始！ */
/* 入力終了！ */

int a;
int prime[10000] = {0};
bool win[10005] = {1,1,0,0,1,1,};
/*                 0 1 2 3 4 5                  */

int chikai(int key)
{
   int left = 0,right = a,mid;

   while(left < right) {
      mid = (left+right)/2;

      if(prime[mid] == key) return mid;

      else if(key < prime[mid]) right = mid;

      else left = mid + 1;
   }

   if(prime[left] > key) return left-1;
   else return left;
}

void judge(int n)
{
   int i,j,k,l;
   for(i=chikai(n);i>-1;i--) {
      if( win[ n - prime[i] ] == 0 ) {
         win[n] = 1; break;
      }
   }
}
int main(void)
{
   int i,j,k,l;
   int n,m;

   prime[0] = 2;

   a = 1;
   for(i=3;i<=10100;i+=2)
   {
      k=0;
      for(j=3;j*j<=i;j+=2)
      {
         if(i%j==0)
         {
            k=1;
            break;
         }
      }
      if(k==0) prime[a++] = i;
   }

   REP(i,3,10001) judge(i);
   
   cin >> n;

   if(win[n]) printf("Win\n");
   else printf("Lose\n");

   return 0;
}