#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef set<int> si;
const int inf = 1e9;
const int mod = 1e9+7;

vi pl;
bool is_prime(int a){
  if(a < 2)return false;
  for(vi::iterator itr = pl.begin(); itr != pl.end(); itr++){
    if(*itr * *itr > a)break;
    if(a % (*itr) == 0)return false;
  }
  return true;
}
bool b[10001];
int n;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  b[0] = true;
  b[1] = true;
  FOR(i, 2, n+1){
    if(is_prime(i))pl.pb(i);
  }
  int maxl = 0, ans;
  FOR(i, 2, n+1){
    bool ok = false;
    for(vi::iterator itr = pl.begin(); itr != pl.end(); itr++){
      if(*itr > i) break;
      if(!b[i - *itr]){
        ok = true;
        break;
      }
    }
    b[i] = ok;
  }
  cout << (b[n] ? "Win" : "Lose") << endl;
}