/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll MOD = 1e9 + 7;
ll INF = 1e18;

const int N = pow(10, 5)+1;

vector<bool> isp(N + 1, true);

void sieve()
{
    isp[0] = false;
    isp[1] = false;
    for (int i = 2; pow(i, 2) <= N; i++)
    {
        if (isp[i])
            for (int j = 2; i * j <= N; j++)
                isp[i * j] = false;
    }
} //N以下の整数をふるってくれます
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    V vec(1e5 + 10);
    vec[0] = -1;
    vec[1] = -1;
    vec[2] = -1;
    vec[3] = -1;
    sieve();
    V prime;
    rep(i,isp.size()){
        if(isp[i])
            prime.push_back(i);
    }
    rep(i,prime.size()){
        vec[2 + prime[i]] = 1;
        vec[3 + prime[i]] = 1;
    }
    rep(i,1e5){
        if(vec[i]==0){
            vec[i] = -1;
            rep(j,prime.size()){
                if(i+prime[j]>1e5+1)
                    break;
                
                vec[i + prime[j]] = 1;
            }
        }
    }
  //  rep(i,1e3)cout<<i<<" "<<vec[i]<<endl;
    ll n;
    cin >> n;
    if(vec[n]==1){
        cout << "Win" << endl;
    }else{
        cout << "Lose" << endl;
    }
}