#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;

const int MAX_N = 11111;

int prime[MAX_N];
bool is_prime[MAX_N + 1];

int sieve(int n) {
    int p = 0;
    for (int i = 0; i <= n; i++) is_prime[i] = true;
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i <= n; i++) {
        if (is_prime[i]) {
            prime[p++] = i;
            for (int j = 2 * i; j <= n; j += i) is_prime[j] = false;
        }
    }
    return p;
}

bool lose[MAX_N];

int main() {
    int n;
    cin >> n;
    int p = sieve(n);
    lose[0] = lose[1] = true;
    for (int i = 2; i <= n; i++) {
        bool flag = false;
        for (int j = 0; j < p; j++) {
            if (i - prime[j] <= 1) break;
            flag |= lose[i - prime[j]];
        }
        lose[i] = !flag;
    }
    if (lose[n]) cout << "Lose" << endl;
    else cout << "Win" << endl;
}