#include <iostream>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>

using namespace std;
typedef uint uint32_t;

bool isPrime(int n) {
    if (n <= 1) return false;
    if (n == 2) return true;
    if (n % 2 == 0) return false;

    for (int i = 3; i <= sqrt(n); i+=2) {
        if (n % i == 0) return false;
    }

    return true;
}

int prime[1500];
int ps = 0;

bool check(int N) {
    int dp[10001] = {};
    // vector<int> prime;

    // if (N == 2 || N == 3) return true;

    dp[0] = dp[1] = 2;  // 1は負け, 2なら勝ち
    dp[2] = dp[3] = 1;

    for (int i = 4; i <= N; i++) {
        dp[i] = 1;
        for (int j = 0; j < ps; j++) {
            int p = prime[j];
            if (i - p < 2) break;
            if (dp[i - p] == 1) {
                dp[i] = 2;
            }
        }
    }

    return dp[N] == 2;
}

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

    for (int i = 2; i < N; i++) {
        if (isPrime(i))
            prime[ps++] = i;
    }

    if (check(N)) cout << "Win" << endl;
    else cout << "Lose" << endl;
}