#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
  int n;
  cin >> n;
  
  vector<int> prime(n + 1, 1);
  prime[0] = prime[1] = 0;
  for (int i = 2; i <= n; i++) {
    if (!prime[i]) continue;
    for (int j = i * 2; j <= n; j += i) {
      prime[j] = 0;
    }
  }

  vector<int> dp(n + 1, -1);
  function<int(int)> rec = [&](int x) {
    if (dp[x] != -1) return dp[x];
    if (x <= 1) return dp[x] = 1;
    int res = 0;
    for (int i = 2; i <= x; i++) {
      if (!prime[i]) continue;
      res |= 1 - rec(x - i);
    }
    return dp[x] = res;
  };

  if (rec(n)) cout << "Win" << endl;
  else cout << "Lose" << endl;
  return 0;
}