#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <fstream>
#include <bitset>
#include <time.h>

#define ll long long
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define EPS 1e-14

using namespace std;


// nまでの素数のリストを作成(nを含む)
vector<long long> getPrimeList(int n) {
    vector<bool> dp(n + 1, false);
    dp[0] = dp[1] = true;
    vector<long long> primeList;
    for (int i = 2; i < n + 1; ++i) {
        if (dp[i]) { continue; }
        primeList.push_back(i);
        for (int j = i; j < n + 1; j += i) {
            dp[j] = true;
        }
    }
    return primeList;
}

map<int, bool> memo;

bool win(int n, const vector<ll> &primes) {
    if (memo.find(n) != memo.end()) {
        return memo[n];
    }

    FOE(p, primes) {
        if (n - p > 1) {
            if (!win(n - p, primes)) {
                return memo[n] = true;
            }
        }
    }
    return memo[n] = false;
}

int main(int argc, char *argv[]) {
    int N;
    cin >> N;
    vector<ll> p = getPrimeList(N);
    cout << (win(N, p) ? "Win" : "Lose") << endl;

    return 0;
}