#include <bits/stdc++.h> 

#define int long long

#define REP(i, b) for(int i = 0; i < (b); i++)
#define REPS(i, b) for(int i = 1; i <= (b); i++)
#define ALL(v) (v).begin(), (v).end()

using namespace std;

using pi = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vb = vector<bool>;
using vpi = vector<pi>;
using vvi = vector<vi>;
using vvb = vector<vb>;

const int INF = 1e10;
const int MOD = 1e9+7;

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

signed main()
{
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int N; cin >> N;
    vb prime(10001, true); prime[0] = prime[1] = false;
    for(int i = 2; i * i <= 10000; i++)
    {
        if(prime[i])
        {
            for(int j = 2*i; j <= 10000; j += i) prime[j] = false;
        }
    }
    vi primetable;
    REP(i, 10001) if(prime[i]) primetable.push_back(i);

    vb win(10001, false); win[0] = win[1] = true;
    for(int i = 4; i <= N; i++)
    {
        REP(j, primetable.size())
        {
            if(i - primetable[j] < 0) break;
            if(win[i-primetable[j]] == false)
            {
                win[i] = true;
                break;
            }
        }
    }
    if(win[N]) cout << "Win" << endl;
    else cout << "Lose" << endl;
}