#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T&a,T b){if(a>b){a=b;return 1;}return 0;}
using ll = long long;

int n;
int dp[100005];
vector<int> ps;

vector< bool > prime_table(int n) {
  vector< bool > prime(n + 1, true);
  if(n >= 0) prime[0] = false;
  if(n >= 1) prime[1] = false;
  for(int i = 2; i * i <= n; i++) {
    if(!prime[i]) continue;
    for(int j = i + i; j <= n; j += i) {
      prime[j] = false;
    }
  }
  return prime;
}

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

    cin >> n;
	vector<bool> v=prime_table(n);
	rep(i,n+1)if(v[i]) ps.push_back(i);

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