#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;

#define ll         long long
#define PI         acos(-1.0)
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)

//方針


vector<int> vp;

//素数作成
void MakePrimeNumber(int n){
    vp.clear();
    int tmp[n+1];
    FOR(i, 0, n+1) tmp[i] = 0;
    FOR(i, 0, n+1) tmp[i] = 1;
    FOR(i, 2, n+1){
        if(tmp[i]==0) continue;
        vp.push_back(i);
        int j = i;
        while(j <= n){
            tmp[j] = 0;
            j += i;
        }
    }
}

void dfs(int n, int me){
    if(n==2 || n==3){
        if(me==1) cout << "Lose" << endl;
        else cout << "Win" << endl;
        return;
    }
    int j = 0;
    int prime = 0;
    while(1){
        if(n-vp[j]>=2) prime = vp[j];
        else break;
        j++;
        if(j==vp.size()) break;
    }
    dfs(n-prime, (me+1)%2);
}

int main(){
  int N;
  cin >> N;
  MakePrimeNumber(N);
  dfs(N, 1);
}