#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#define MAX 10000
using namespace std;

bool isPrime(int n){
    if(n == 1){
        return false;
    }
    if(n == 2){
        return true;
    }
    bool flag = true;
    for (int i = 2; i < n; i++) {
        if(n%i == 0){flag = false;}
        break;
    }
    return flag;
}

vector<int> returnPrimeList(int n){
    vector<int> a;
    if(n == 1){return a;}
    a.push_back(2);//2は先に追加しておく
    for (int i = 3; i <= n; i += 2) {
        //素数の場合追加
        if(isPrime(i)){a.push_back(i);}
    }
    return a;
}


int main(int argc, const char * argv[]) {
    int n;
    cin >> n;
    queue<int> qu;
    queue<int> tmpqu;
    int tmp1;
    vector<int> tmp2;
    int tmp3;
    int count = 1;
    bool flag = false;
    bool visited[MAX];
    for (int i = 0; i < MAX; i++) {
        visited[i] = false;
    }
    //初期値を入力
    qu.push(n);
    while(!flag){
        count++;
        //値を取得
        flag = true;
        while(!qu.empty()){
            tmp1 = qu.front();
            if(tmp1 > 1){flag = false;}
            tmpqu.push(tmp1);
            qu.pop();
        }
        //可能な減算をすべて行う
        while (!tmpqu.empty()) {
            tmp1 = tmpqu.front();
            tmp2 = returnPrimeList(tmp1);
            for (int i = 0; i < tmp2.size(); i++) {
                tmp3 = tmp1 - tmp2[i];
                if(!visited[tmp3]){
                    visited[tmp3] = true;
                    qu.push(tmp3);
                }
            }
            tmpqu.pop();
        }
    }
   
    if (count % 2 == 0) {
        cout << "Win";
    }
    else{cout << "Lose";}
    cout << "\n";
}