#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

//素数判定
bool prime(ll n) {
	if (n == 1) {
		return false;
	}
	for (int i = 2; i*i <= n; i++) {
		if (n%i == 0) {
			return false;
		}
	}
	return true;
}

int main(){
	vector<int>is_prime(10010);
	rep(i, 2, 10001) {
		if (prime(i))is_prime[i] = 1;
	}
	vector<int>winner(10010);
	winner[2] = 2;

	rep(i,3,10001) {
		rep(j, 2, i) {
			if (is_prime[i - j] && winner[j] == 2)winner[i] = 1;
		}
		if (winner[i] == 0)winner[i] = 2;
		cout << winner[i] << endl;
	}

	int n;
	cin >> n;


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