#include <bits/stdc++.h>

using namespace std;

bool is_prime[10010];
vector<int> prime;

void sieve(int n) {
  fill(is_prime, is_prime + n, true);
  is_prime[0] = is_prime[1] = false;
  for (int i = 0; i < n; i++) {
    if (!is_prime[i]) continue;
    prime.push_back(i);
    for (int j = 2 * i; j < n; j += i) {
      is_prime[j] = false;
    }
  }
}

int main(void) {
  int n;
  cin >> n;

  sieve(n + 1);

  bool dp[10010] = {};
  dp[0] = dp[1] = true;
  for (int i = 2; i <= n; i++) {
    bool lose = true;
    for (int j = 0; j < prime.size() && prime[j] <= i; j++) {
      lose &= dp[i - prime[j]];
    }
    dp[i] = !lose;
  }
  cout << (dp[n] ? "Win" : "Lose") << endl;

  return 0;
}