#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, r) for(int i = 0; i < (r); ++i)
#define reps(i, s, r) for(int i = (s); i < (r); ++i)
#define fore(i, m2) for(auto &i : m2)
#define vi vector<int>
#define vl vector<ll>
#define pl pair<ll, ll>
#define all(i) (i).begin(), (i).end()
#define fs first
#define sc second

template <class T> bool chmin(T &i, T b) {
    if(i > b) {
        i = b;
        return true;
    }
    return false;
}
template <class T> bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

const ll INF = LONG_LONG_MAX / 3;
const ll MOD = 1'000'000'007;
const ll MAX = 1e4 + 5;

vl getPrmAry(ll mx) {

    int i, j, k;
    vl p;
    p.push_back(2);

    for(i = 3; i <= mx; i += 2) {
        k = 0;
        for(j = 3; j <= sqrt(i); j += 2) {
            if(i % j == 0) {
                k = 1;
                break;
            }
        }
        if(k == 0) {

            p.push_back(i);
        }
    }
    return p;
}

int main() {

    ll n;
    cin >> n;

    ll dp[MAX];
    dp[0] = dp[1] = true;
    vl p = getPrmAry(n);

    reps(i, 2, n + 1) {

        ll d = lower_bound(all(p), i) - p.begin();
        if(p[d] == i)
            d++;

        ll win = 0;
        rep(j, d) {
            if(dp[i - p[j]] == 0) {
                win = 1;
                break;
            }
        }
        dp[i] = win;
    }

    if(dp[n])
        puts("Win");
    else
        puts("Lose");
}