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

#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define long int64_t
#define ulong uint64_t

const int N = 10000;
int not_prime[N + 1] = {1, 1};
vector<int> primes;
int lose[N + 1];

void prepare()
{
    for (int i = 2; i * i <= N; ++i) {
        if (not_prime[i]) continue;
        for (int j = i * i; j <= N; j += i) {
            not_prime[j] = 1;
        }
    }
    repi(i, 2, N + 1) {
        if (not_prime[i]) continue;
        primes.push_back(i);
    }
    repi(i, 2, N + 1) {
        int win = 0;
        for (int p : primes) {
            if (p > i) break;
            if (lose[i - p]) {
                win = 1;
                break;
            }
        }
        lose[i] = not win;
    }
}

int n;

void input()
{
    cin >> n;
}

bool solve()
{
    return not lose[n];
}

int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    prepare();
    input();
    cout << (solve() ? "Win" : "Lose") << endl;
}