#include <bits/stdc++.h>

using namespace std;

const int SZ = 10000;

vector< int > primes;
int dp[SZ + 1];

bool rec(int val)
{
  if(val <= 1) return (true);
  if(~dp[val]) return (dp[val]);
  for(int i = 0; i < primes.size(); i++) {
    if(primes[i] > val) break;
    if(!rec(val - primes[i])) return (dp[val] = true);
  }
  return (dp[val] = false);
}

int main()
{
  bool prime[SZ + 1] = {};
  for(int i = 2; i <= SZ; ++i) {
    if(!prime[i]) {
      for(int j = i + i; j <= SZ; j += i) prime[j] = true;
      primes.push_back(i);
    }
  }

  int N;
  cin >> N;
  memset(dp, -1, sizeof(dp));
  cout << (rec(N) ? "Win" : "Lose") << endl;
}