#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

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

  vector<int> f(n + 1), primes;
  f[0] = f[1] = -1;
  for (int i = 2; i <= n; ++i) {
    if (f[i]) continue;
    primes.push_back(i);
    f[i] = i;
    for (int j = i * i; j <= n; j += i) { f[j] = i; }
  }

  vector<int> ans(n + 1);
  ans[0] = ans[1] = 1;
  for (int i = 2; i <= n; ++i) {
    bool win = 0;
    for (auto p : primes) {
      if (i - p < 0) break;
      int ni = i - p;
      if (!ans[ni]) win = 1;
    }
    if (win) ans[i] = 1;
  }

  if (ans[n])
    cout << "Win" << endl;
  else
    cout << "Lose" << endl;
  return 0;
}