#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <queue>
using namespace std;
#define MAX 10005

bool pdp[MAX];
vector<int> makeprime(int N){
    vector<int> ret;
    for(int i=2; i<=N; i++){
        if(pdp[i]) continue;
        ret.push_back(i);
        for(int j=i+i; j<MAX; j+=i) pdp[j] = true;
    }
    return ret;
}


int main(){
    int N;
    cin >> N;
    auto prime = makeprime(N);
    bool dp[N];
    dp[0] = dp[1] = true;
    for(int i=2; i<=N; i++){
        for(int j : prime){
            if(i-j<0) break;
            dp[i] |= !dp[i-j];
        }
    }
    if(dp[N]) cout << "Win" << endl;
    else cout << "Lose" << endl;
}