#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <time.h>
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FFOR(i,a,b) for(int i=(a);i<=(b);i++)
#define REP(i,b) FOR(i,0,b)
#define RREP(i,b) FFOR(i,1,b)
#define PB push_back
#define F first
#define S second
#define BE(c) c.begin(),c.end()
using namespace std;
typedef long long LL;
typedef LL ut;
typedef long double ld;
typedef pair<ut,ut> pr;
typedef vector<pr> Vpr;
typedef vector<ut> VI;
typedef pair<ut,pr> ppr;
typedef priority_queue<pr,Vpr, greater<pr> > PQ;
const int SIZE=1e+5 + 1;
const ut INF=1<<30;
const ld eps=1e-6;
const LL mod=1e+9 + 7;

vector<int> primes;
bool is_prime[11000];

void make_prime(int n){
	REP(i,n+1)
		is_prime[i] = true;
	is_prime[0] = is_prime[1] = false;
	FOR(i,2,n+1){
		if(is_prime[i]){
			primes.PB(i);
			for(int j = i * 2; j <= n; j += i)
				is_prime[i] = false;
		}
	}
}

int main() {
	cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    make_prime(n);
    bool win[10001];
    win[0] = win[1] = false;
    
    FOR(j,2,n+1){
    	REP(i,primes.size()){
    		if(j - primes[i] < 0)
    			continue;
    		win[j] |= !win[j - primes[i]];
    	}
    }
    if(win[n])
    	cout << "Win" << endl;
    else
    	cout << "Lose" << endl;
 	return 0;
}