/* -*- coding: utf-8 -*-
 *
 * 7.cc: No.7 プライムナンバーゲーム - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_P = 10000;

/* typedef */

typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

bool primes[MAX_P + 1], wls[MAX_P + 1];

/* subroutines */

void gen_primes(int maxp, vi &pnums) {
  memset(primes, true, sizeof(primes));
  primes[0] = primes[1] = false;

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums.push_back(p);
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums.push_back(p);
}

/* main */

int main() {
  int n;
  cin >> n;

  vi pnums;
  gen_primes(n, pnums);

  wls[0] = wls[1] = true;

  for (int i = 2; i <= n; i++) {
    wls[i] = false;
    for (vi::iterator vit = pnums.begin(); vit != pnums.end(); vit++) {
      int &pi = *vit;
      if (i < pi) break;
      if (! wls[i - pi]) {
	wls[i] = true;
	break;
      }
    }
  }
  //for (int i = 0; i <= n; i++) printf("%d", wls[i]); putchar('\n');

  cout << (wls[n] ? "Win" : "Lose") << endl;
  return 0;
}