#include <bits/stdc++.h>

using namespace std;

int N;
int dp[10101];
vector<int> primes;

int dfs(int v) {
  if (v <= 1) return 1;
  if (dp[v] != 0) return dp[v];
  for (auto x : primes) {
    if (v < x) break;
    if (dfs(v - x) == 2) return dp[v] = 1;
  }
  return dp[v] = 2;
}

int main() {
  cin >> N;
  primes.assign(N + 1, 0);
  for (int i = 2; i <= N; ++i) primes[i] = i;

  for (int i = 2; i * i <= N; ++i) {
    if (primes[i]) {
      for (int j = i * i; j <= N; j += i) primes[j] = 0;
    }
  }
  primes.erase(remove(primes.begin(), primes.end(), 0), primes.end());

  if (dfs(N) == 1) {
    cout << "Win\n";
  } else {
    cout << "Lose\n";
  }

  return 0;
}