#include <bits/stdc++.h>

using namespace std;

class Prime {
private:
  vector<long long> div;
  
public:
  Prime(long long n = 0) {
    for (long long i = 0; i < n; ++i) div.emplace_back(i);
    for (long long i = 2; i <= n / i; ++i) if (div[i] == i) {
      for (long long j = i * i; j < n; j += i) div[j] = i;
    }
  }
  
  bool isPrime(long long n) const {
    if (n <= 1) return false;
    if (n < (long long)div.size()) return div[n] == n;
    for (long long i = 2; i <= n / i; ++i) if (n % i == 0) return false;
    return true;
  }
  
  vector<long long> factor(long long n) const {
    vector<long long> res;
    for (long long i = 2; i <= n / i && n >= (long long) div.size(); ++i) {
      while (n % i == 0) {
        res.emplace_back(i);
        n /= i;
      }
    }
    if (n >= (long long)div.size()) {
      res.emplace_back(n);
    } else {
      while (n > 1) {
        res.emplace_back(div[n]);
        n /= div[n];
      }
    }
    sort(res.begin(), res.end());
    return res;
  }
  
  vector<long long> primeFactor(long long n) const {
    vector<long long> res;
    for (long long i = 2; i <= n / i && n >= (long long)div.size(); ++i) {
      if (n % i) continue;
      res.emplace_back(i);
      while (n % i == 0) n /= i;
    }
    if (n >= max((long long)div.size(), 2ll)) {
      res.emplace_back(n);
    } else {
      while (n > 1) {
        long long d = div[n];
        res.emplace_back(d);
        while (n % d == 0) n /= d;
      }
    }
    sort(res.begin(), res.end());
    return res;
  }

  vector<long long> divisor(long long n) const {
    vector<long long> res;
    for (long long i = 1; i <= n / i; ++i) {
      if (n % i == 0) {
        res.emplace_back(i);
        if (i != n / i) res.emplace_back(n / i);
      }
    }
    sort(res.begin(), res.end());
    return res;
  }
};

template<typename T, typename State, bool Memoize = false> class MinMax {
protected:
  virtual T eval(const State&) const = 0;
  virtual vector<State> next(const State&) const = 0;
  virtual bool isTerminated(const State& state) const {return next(state).empty();}
  virtual bool used(const State&) const {return false;}
  virtual T memo(const State&) {return T();}
  virtual void use(const State&, const T&) {}

public:
  T solve(const State& state) {
    if (Memoize && used(state)) return memo(state);
    if (isTerminated(state)) return eval(state);
    T score = numeric_limits<T>::min() + 1;
    for (const State& child : next(state)) score = max(score, -solve(child));
    if (Memoize) use(state, score);
    return score;
  }
};

class Game : public MinMax<int, int, true> {
private:
  vector<int> mem;
  vector<int> primes;

  int eval(const int&) const {
    return 1;
  }

  vector<int> next(const int& state) const {
    vector<int> res;
    for (int p : primes) {
      if (p > state) break;
      res.emplace_back(state - p);
    }
    return res;
  }

  bool used(const int& state) const {
    return mem[state] != 0;
  }

  int memo(const int& state) {
    return mem[state];
  }

  void use(const int& state, const int& score) {
    mem[state] = score;
  }

public:
  Game(int n) : mem(n + 1) {
    Prime prime;
    for (int i = 0; i <= n; ++i) {
      if (prime.isPrime(i)) primes.emplace_back(i);
    }
  }
};

int main() {
  int n;
  cin >> n;
  Game game(n);
  cout << (game.solve(n) == 1 ? "Win" : "Lose") << endl;
}