#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> p(n + 1, 1);
  p[0] = p[1] = 0;
  for (int i = 2; i <= n; i++) {
    if (!p[i]) continue;
    for (int j = 2 * i; j <= n; j += i) {
      p[j] = 0;
    }
  }
  vector<int> dp(n + 1, -1);
  dp[2] = 0;
  for (int i = 2; i <= n; i++) {
    if (dp[i] == -1) continue;
    for (int j = 0; j <= n; j++) {
      if (!p[j]) continue;
      if (i + j <= n && dp[i + j] == -1) dp[i + j] = 1 - dp[i];
    }
  }
  if (dp[2] == dp[n]) cout << "Lose" << endl;
  else cout << "Win" << endl;
  return 0;
}