#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}







int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        vector<bool>f(11005);
        f[2] = 1;
        vector<int>x;
        x.push_back(2);
        for (int i = 3; i  <= 10000; i += 2) {
            f[i] = 1;
            for (int j = 3; j * j <= i; j += 2) {
                if (i % j)continue;
                f[i] = 0; break;
            }
            if (f[i])x.push_back(i);
        }
        vector<int>y(30005,1000000);
         y[2] = 1; y[3] = 1;
        for (int i = 2; i <= 10000; i++) {
            if (y[i] == 1000000)continue;
            for (int j = 0;  j < x.size(); j++) {
                if (y[i + x[j]] == 1000000)y[i + x[j]] = y[i] + 1;
                else if ((y[i] + 1) % 2 == 0)y[i + x[j]] = 2;
            }
        }
        int n;
        cin >> n;
        //for (int i = 0; i <= n; i++)cout<<y[i] << endl;
        if (n < 4)cout << "Lose";
        else if (y[n] == 1000000||y[n]%2)cout << "Lose";
        else cout << "Win";
        
    }
        return 0;
}