#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

void findPrime(int N, vector<bool>& isPrime)
{
    isPrime.assign(N+1, true);
    isPrime[0] = isPrime[1] = false;
    for(int i=2; i*i<=N; i++){
        if(isPrime[i]){
            for(int j=i; i*j<=N; j++){
                isPrime[i*j] = false;
            }
        }
    }
}

int main()
{
    int n;
    cin >> n;
    vector<bool> isPrime;
    findPrime(n, isPrime);

    vector<bool> dp(n+1, false);
    dp[0] = dp[1] = false;
    for(int i=2; i<=n; ++i){
        for(int j=2; j<=i-2; ++j){
            if(isPrime[j] && !dp[i-j])
                dp[i] = true;
        }
    }

    if(dp[n])
        cout << "Win" << endl;
    else
        cout << "Lose" << endl;

    return 0;
}