#include <bits/stdc++.h>

using namespace std;

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

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

bool prime_check(int n){
  if (n == 2) {
    return true;
  } else if (n < 2 || n & 1 == 0) {
    return false;
  } else {
    return pow(2, n-1) / n == 1;
  }
}

int main(){
  cin >> N;

  dp[0] = 1;
  dp[1] = 1;

  for (int i=2;i<=N;i++) {
    if (prime_check(i)) {
      primes.push_back(i);
    }

    dp[i] = -1;
    for (auto p: primes) {
      if (dp[i-p] == -1) {
        dp[i] = 1;
        break;
      }
    }
  }

  cout<< (dp[N] == 1 ? "Win" : "Lose") <<endl;
}