// g++ -std=c++11 temp.cpp
#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) FOR(i,0,n)
#define EACH(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;

#define INF INT_MAX/3

#define MAX_N 1000

int n;
bool is_prime[11111];
bool is_win[11111];

int main(){
	cin>>n;
	REP(i,11111) is_prime[i] = true;
	is_prime[0] = is_prime[1] = false;
	for(int i = 2; i <= 10000; i++){
		if(is_prime[i]){
			for(int j = i*2; j <= 10000; j += i) is_prime[j] = false;
		}
	}

	REP(i,11111) is_win[i] = false;
	is_win[0] = is_win[1] = true;
	FOR(i,4,10001){
		bool flag = false;
		FOR(j,2,i+1){
			if(is_prime[j] && !is_win[i-j]) flag = true;
		}
		is_win[i] = flag;
	}
	if(is_win[n]) cout<<"Win"<<endl;
	else cout<<"Lose"<<endl;

	return 0;
}