#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
using ll = long long;
constexpr ll MOD = 1000000007;

constexpr int MAX = 10000;
bool isprime[MAX + 1];
bool win[MAX + 1];

int main()
{
    rep(i, MAX + 1)
    {
        isprime[i] = true;
    }
    for (int i = 2; i <= MAX; i++) {
        if (isprime[i]) {
            for (int j = 2; i * j <= MAX; j++) {
                isprime[i * j] = false;
            }
        }
    }

    int n;
    cin >> n;

    win[0] = true;
    win[1] = true;
    win[2] = false;
    win[3] = false;
    for (int i = 4; i <= n; i++) {
        win[i] = false;
        for (int j = 2; j <= i; j++) {
            if (isprime[j]) {
                if (not win[i - j]) {
                    win[i] = true;
                    break;
                }
            }
        }
    }
    if (win[n]) {
        cout << "Win" << endl;
    } else {
        cout << "Lose" << endl;
    }
    return 0;
}