#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <numeric>
#include <cstring>
#include <cmath>
#include <set>
#include <queue>
#include <stack>

const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using edge = struct{int to; int cost;};

bool isPrime[10010];
int Win[10010];

void Prime(int N)
{
    rep(i, 10010) isPrime[i] = true;

    isPrime[0] = false;
    isPrime[1] = false;

    for(int i = 2; i <= sqrt(N) + 1; i++)
        if(isPrime[i])
            for(int j = i * 2; j <= N + 1; j += i)
                isPrime[j] = false;
}

int dp[10010];

int main()
{
    int N;
    cin >> N;
    Prime(N);
    dp[0] = 1;
    dp[1] = 1;
    for(int i = 2; i <= 10000; i++)
    {
        for(int j = 2; j <= 10000; j++)
        {
            if(isPrime[j])
            {
                if(j > i) break;
                if(dp[i - j] == 0) 
                {
                    dp[i] = 1;
                    break;
                }
            }
        }
    }

    cout << (dp[N] ? "Win" : "Lose") << endl;
    return 0;
}