#include <bits/stdc++.h>

using namespace std;

#define REP(i, n)   for(int i = 0; i < (n); i++)
#define REPS(i, n)  for(int i = 1; i <= (n); i++)
#define RREP(i, n)  for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back

using ll  = long long;
using pi  = pair<int, int>;
using pl  = pair<ll, ll>;
using vi  = vector<int>;
using vl  = vector<ll>;
using vs  = vector<string>;
using vvi = vector<vi>;

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

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

vi prime;

int dp[10010];
int grundy(int x)
{
    if(dp[x] != -1) return dp[x];
    if(x == 2 || x == 3) return 0;

    set<int> s;
    REP(i, (int)prime.size())
    {
        if(x - prime[i] >= 2) s.insert(grundy(x-prime[i]));
    }

    if(s.find(0) == s.end()) return dp[x] = 0;
    return dp[x] = 1;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    vector<bool> isPrime(10001, true);
    isPrime[0] = isPrime[1] = false;
    for(int i = 2; i * i <= 10001; i++)
    {
        if(isPrime[i])
        {
            for(int j = 2*i; j <= 10000; j += i) isPrime[j] = false;
        }
    }

    for(int i = 2; i <= 10000; i++) if(isPrime[i]) prime.pb(i);

    memset(dp, -1, sizeof(dp));

    int N;
    cin >> N;
    if(grundy(N) == 0) cout << "Lose" << endl;
    else cout << "Win" << endl;
}