#include <bits/stdc++.h>

using namespace std;

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

const double PI = acos(-1);

vector<int> getprimes(int n) {
  vector<bool> p(n+1, true);
  int m = 0;
  for (int i = 2; i <= n; i++) {
    if (p[i]) {
      ++m;
      for (int j = 2 * i; j <= n; j += i)
        p[j] = false;
    }
  }
  vector<int> ret(m);
  int j = 0;
  for (int i = 2; i <= n; i++) {
    if (p[i])
      ret[j++] = i;
  }
  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  vector<int> ps = getprimes(n);
  vector<bool> win(n+1);
  win[0] = win[1] = true;

  for (int i = 2; i <= n; i++) {
    for (auto j: ps) {
      if (i-j >= 0 && !win[i-j])
        win[i] = true;
    }
  }

  if (win[n])
    cout << "Win" << endl;
  else
    cout << "Lose" << endl;
  
  return 0;
}