#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(-1.0L);
ll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }
ll LCM(ll a, ll b) { return a/GCD(a, b)*b; }

// Eratosthenesの篩
vector<bool> primeno(100010, true);
void Eratosthenes(int n) {
    primeno.at(0) = primeno.at(1) = false;
    int limit = sqrt(n);
    for(int i = 2; i < limit; ++i) {
        if(primeno.at(i)) {
            for(int j = 0; i*(j+2) < n; ++j) {
                primeno.at(i*(j+2)) = false;
            }
        }
    }
}

int n;

int main() {
    cin >> n;
    Eratosthenes(10010);
    vector<int> check(10010, -1);
    check[0] = check[1] = 0;
    check[2] = check[3] = 0;
    for(int i = 2; i <= n; ++i) {
        if(check[i] != -1) {
            for(int j = 2; j <= n; ++j) {
                if(primeno[j]) {
                    if(check[i+j] == -1) {
                        if(check[i] == 0) {
                            check[i+j] = 1;
                        }else check[i+j] = 0;
                    }
                }
            }
        }
    }

    if(check[n] == 0) cout << "Lose" << endl;
    else cout << "Win" << endl;
}