#include <iostream>
#include <vector>
#include <array>
#include <cmath>

using namespace std;
const int MAX_N = 10000;

int N;
vector<bool> primes(MAX_N + 1, true);
vector<int> dp(MAX_N + 1, -1);

#define REP(i,first,last) for (int i=first;i<last;i++)

int solve(int n){
  if (dp[n] != -1) return dp[n];
  for (int i=2;i<n;i++) {
    if (!primes[i]) continue;
    if (solve(n-i) == 0) {
      return dp[n] = 1;
    }
  }
  return dp[n] = 0;
}

int main(){
  cin >> N;

  //ふるい
  primes[0] = false;
  primes[1] = false;
  for (int i=2;i<=MAX_N;i++) {
    if (primes[i]) {
      for (int j=i*2;j<=MAX_N;j+=i) {
        primes[j] = false;
      }
    }
  }

  //0はnil 1はfalse 2はtrue
  dp[0] = 1;
  dp[1] = 1;

  if (solve(N) == 1) {
    cout<<"Win"<<endl;
  } else {
    cout<<"Lose"<<endl;
  }
}