#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

const int MAXN = 20100;
int dp[MAXN];
bool isPrime[MAXN];
vector<int> prime;

void createPrime() {
    for (int i = 2; i < MAXN; i++) isPrime[i] = true;
    for (int i = 2; i * i < MAXN; i++) {
        if (isPrime[i]) {
            for (int j = 2; i * j < MAXN; j++) {
                isPrime[i*j] = false;
            }
        }
    }
    for (int i = 2; i < MAXN; i++) {
        if (isPrime[i]) prime.push_back(i);
    }
}

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

int main(void) {
    createPrime();
    int N;
    cin >> N;
    dp[0] = dp[1] = 1;
    int result = dfs(N);
    if (result == 1) cout << "Win" << endl;
    else cout << "Lose" << endl;
    return 0;
}