#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <cstring>

using namespace std;

bool not_prime[10001];
vector <int> prime;
int memo[10001];

int main() {
  int n;
  cin >> n;
  memset(not_prime, false, sizeof(not_prime));
  memset(memo, -1, sizeof(memo));
  not_prime[1] = true;
  for (int i = 2; i <= n; i++) {
    for (int j = i+i; j <= n; j+=i) {
      not_prime[j] = true;
    }
  }
  for (int i = 2; i <= n; i++) if (!not_prime[i]) prime.push_back(i);

  bool dp[n+1];
  memset(dp, false, sizeof(dp));
  for (int i = 2; i <= n; i++) {
    if (dp[i]) continue;
    for (int j = 0; j <= prime.size(); j++) {
      if (i+prime[j] > n) break;
      dp[i+prime[j]] = true;
    }
  }

  if (dp[n]) {
    cout << "Win" << endl;
  }else {
    cout << "Lose" << endl;
  }
}