#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の時] :=(偶数=先行勝利)　
int dp[10001];

int main(void){
	rep(i, 10001) dp[i] = -1;
	int n; cin >> n;
	eratos(n);
	// rep(i, prime.size()) printf("%d\n", prime[i]);
	dp[2] = dp[3] = 1;
	for (int i = 4; i <= 10000; ++i){
		for (int j = 0; j < prime.size(); ++j){
			if(i - prime[j] < 2) break;
			if(dp[i - prime[j]] != -1){
				dp[i] = dp[i - prime[j]] + 1;
				//printf("%d\n", dp[i]);
			}
		}
	}

	if(dp[n] % 2 == 0) printf("Win\n");
	else printf("Lose\n");
	return 0;
}