#include <bits/stdc++.h>
using namespace std;

void GetPrimes(int N, vector<int> &v) {
	v = vector<int>();
    int c = 1;
    while (c < N) {
            c++;
            bool flag = true;
            int d = (int)sqrt(c);
            for(int i = 0; i < v.size(); i++) {
            	if(c % v[i] == 0) {
            		flag = false;
            		break;
            	}
            	if (d < v[i]) break;
            }
            if(flag) v.push_back(c);
    }
}

int dp[10001];

vector<int> P;

int recursive(int n) {
	if(dp[n] >= 0) return dp[n];
	if(n < 2) return dp[n] = 1;
	for(int i = 0; i < P.size(); i++) {
		if(n < P[i]) break;
		if(!recursive(n - P[i])) return dp[n] = 1;
	}
	return dp[n] = 0;
}

int main() {
	GetPrimes(20000, P);
	for(int i = 0; i < 10001; i++) {
		dp[i] = -1;
	}
	int N;
	cin >> N;
	recursive(N);
	cout << (dp[N] ? "Win" : "Lose") << endl;
}