#include <bits/stdc++.h>
using namespace std;
void returnprime(int a[],int N){
    int i,j,p;
    int check = 0;
    int k = 0;
    int num[100000];
    for(i=1;i<=N;i++){
        num[i] = 0;
    }
    num[1] = 1;
    p = 2;
    while(1){
        for(i=1;i<=N;i++){
            if(num[i] == 1) check = 1;
            else{
                check = 0;
                break;
            }
        }
        a[k] = p;
        k++;
        if (check == 1) break;
        for(i=p;i<=N;i++){
            if(i%p == 0) num[i] = 1;
        }
        for(i=p;i<=N;i++){
            if(num[i] != 1){
                p=i;
                break;
            }
        }
    }
}

int main(){
    int prime[10000],i,N,j,judge[10001];
    cin >> N;
    for(i=0;i<10000;i++){
        prime[i] = 0;
        judge[i+1] = 0;
    }
    returnprime(prime,N);
    judge[0] = 1;
    judge[1] = 1;
    for(i=2;i<=N;i++){
        for(j=0;prime[j]!=0;j++){
            if(i - prime[j] < 0) break;
            if(judge[i - prime[j]] == 0) judge[i] = 1;
        }
    }
    if(judge[N] == 1) cout << "Win" << endl;
    else cout << "Lose" << endl;
}