#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)

vector<int> prime;
bool isprime[10001];
//エラトテネス
void eratos(int m){
    for (int i = 0; i <= m; ++i) isprime[i] = true;
    isprime[0] = isprime[1] = false;
    //iを残してiの倍数を消していく
    for (int i = 2; i <= m; ++i){
        if(isprime[i]){
        	prime.push_back(i);
            for (int j = 2 * i; j <= m; j += i){
                isprime[j] = false;
            }
        }
    }
    return;
}

//dp[N = iの時] :=(true=先行勝利)　
bool dp[10001];

int main(void){
	int n; cin >> n;
	eratos(n);
	dp[2] = dp[3] = false;
	for (int i = 0; i < prime.size(); ++i){
		int nowa = 2, nowb = 3;
		if(nowa + prime[i] <= n){
			if(dp[nowa]) dp[nowa + prime[i]] = false;
			else dp[nowa + prime[i]] = true;
		}
		if(nowb + prime[i] <= n){
			if(dp[nowb]) dp[nowb + prime[i]] = false;
			else dp[nowb + prime[i]] = true;
		}
	}
	if(dp[n]) printf("Win\n");
	else printf("Lose\n");
	return 0;
}