#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <vector>
#include <numeric>
//#include <tuple>
#include <cstdio>

using namespace std;

typedef long long ll;


#define rep(i,b) for(ll i=0;i<(b);++i)
#define rep1(i,b) for(ll i=1;i<=(b);++i)
#define vec vector
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl;

int N;

vector<int> genprime(int n) {
   vector<int> prime;
   prime.push_back(2);
   for (int i=1;2*i+1<=n;i++) {
      int k = 2*i+1;
      for (int j=0;j<prime.size();j++) {
         if (sqrt(k)+1 < prime[j]) {
            break;
         }
         if ( k % prime[j] == 0) {
            goto end;
         }
      }
      prime.push_back(k);
      end:
      continue;
   }
   return prime;
}

int dp[10010];

int main() {
   cin >> N;
   dp[0] = 1;
   dp[1] = 1;
   auto prime = genprime(N);
   for (int i=2;i<=N;i++) {
      rep(j, prime.size()) {
         if (prime[j] > i) break;
         if (dp[i-prime[j]] == 0) {
            dp[i] = 1;
            break;
         }
      }
   }
   cout << (dp[N] ? "Win" : "Lose") << endl;
}