#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

bool prime[16384], dp[16384];

int main() {
  int N; cin >> N;
  for (int i = 2; i <= N; ++i) prime[i] = true;
  for (int i = 2; i * i <= N; ++i) {
    if (!prime[i]) continue;
    for (int j = i * i; j <= N; j += i) prime[j] = false;
  }
  dp[0] = true, dp[1] = true;
  for (int i = 2; i <= N; ++i)
    for (int j = 2; j <= i; ++j)
      if (prime[j] && !dp[i-j]) dp[i] = true;
  cout << (dp[N] ? "Win" : "Lose") << endl;
  return 0;
}