#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

std::vector<int> prime_sieve(int n, bool get_only_prime) {
  std::vector<int> prime, smallest_prime_factor(n + 1);
  std::iota(smallest_prime_factor.begin(), smallest_prime_factor.end(), 0);
  for (int i = 2; i <= n; ++i) {
    if (smallest_prime_factor[i] == i) prime.emplace_back(i);
    for (int p : prime) {
      if (i * p > n || p > smallest_prime_factor[i]) break;
      smallest_prime_factor[i * p] = p;
    }
  }
  return get_only_prime ? prime : smallest_prime_factor;
}

template <typename T>
bool nim(const std::vector<T> &a) {
  long long x = 0;
  for (const T e : a) {
    x ^= e;
  }
  return x != 0;
}

template <typename T>
bool misere_nim(const std::vector<T> &a) {
  return *std::max_element(a.begin(), a.end()) <= 1 ? a.size() % 2 == 0 : nim(a);
}

int main() {
  int n; cin >> n;
  const vector<int> prime = prime_sieve(n, true);
  vector<int> grundy(n + 1, 0);
  FOR(i, 2, n + 1) {
    set<int> s;
    for (int p : prime) {
      if (p > i) break;
      s.emplace(grundy[i - p]);
    }
    while (s.count(grundy[i]) == 1) ++grundy[i];
  }
  cout << (grundy[n] > 0 && !misere_nim(vector<int>{grundy[n]}) ? "Lose\n" : "Win\n");
  return 0;
}