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

bool is_prime(int n) {
    for (int i = 2; i * i <= n; i++)
        if (n % i == 0) return false;
    return true;
}

int memo[10010];

vector<int> V;
int f(int x) {
    if (memo[x] != -1)
        return memo[x];
    for (int i = 0; i < V.size() && V[i] <= x; i++) {
        if (f(x - V[i]) == 0)
            return memo[x] = 1;
    }
    return memo[x] = 0;
}

int main() {
    int N;
    cin >> N;

    for (int i = 2; i <= N; i++) {
        if (is_prime(i))
            V.push_back(i);
    }

    for (int i = 0; i <= N; i++)
        memo[i] = -1;
    memo[0] = 1;
    memo[1] = 1;

    cout << (f(N) ? "Win" : "Lose") << endl;
}