#include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
using namespace std;

vector<int> prime(int N){
    vector<int> v;
    v.push_back(2);
    for(int i=3; i<=N; i+=2){
        bool flag = true;
        for(int j=3; j<=sqrt(i); j+=2){
            if(i%j==0){
                flag = false;
                break;
            }
        }
        if (flag==true) v.push_back(i);
    }
    return v;
}

int main(){
    int N;
    cin >> N;
    bool dp[N+1];
    dp[0] = true;
    dp[1] = true;
    for(int i=2; i<=N; i++){
        dp[i] = false;
        for(int p: prime(i)){
            if(dp[i-p]==false){
                dp[i] = true;
                break;
            }
        }
    }
    cout << (dp[N]?"Win":"Lose") << endl;
    return 0;
}