#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ul;
typedef signed long long ll;
ul over = 1000000007;

int main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed;
  ll n;
  cin >> n;
  bool isPrime[n+1];
  for (ll i = 0; i <= n; ++i) isPrime[i] = true;
  isPrime[0] = false; isPrime[1] = false;
  vector< ll > PrimeList;
  for (ll piv = 2; piv <= n; ++piv) {
    if (isPrime[piv] == false) continue;
    for (ll amp = 2; piv * amp <= n; ++amp) isPrime[piv * amp] = false;
    PrimeList.push_back(piv);
  }
  PrimeList.push_back(n+1);
  bool isWin[n+1];
  isWin[0] = true; isWin[1] = true;
  for (ll i = 2; i <= n; ++i) {
    bool canWin = false;
    for (ll j = 0; PrimeList[j] <= i; ++j) {
      if (!isWin[i - PrimeList[j]]) {canWin = true; break;}
    }
    isWin[i] = canWin;
  }
  cout << (isWin[n] ? "Win" : "Lose") << endl;
  return 0;
}