#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

const int MAX = 10100;

vector<int> sieve(int n){
    int p = 0;
    vector<int> prime;
    vector<bool> is_prime(n+1,true);
    is_prime[0] = is_prime[1] = false;
    for(int i = 2 ; i <= n ; i++){
        if(is_prime[i]){
            prime.push_back(i);
            for(int j = 2*i; j <= n; j += i){
                is_prime[j] = false;
            }
        }
    }
    return prime;
}

bool dp[MAX];

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

  auto prime = sieve(n);
 
  dp[0] = dp[1] = true;

  for (int i = 2; i <= n; i++) {
    for (auto j : prime) {
      if (i - j < 0) break;
      dp[i] |= !dp[i - j];
    }
  }
  cout << (dp[n] ? "Win" : "Lose") << endl;
  return 0;
}