#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  for(int i=0;i<(n);i++)
#define FORq(i, m, n) for(int i = (m);i <= (n);i++)
#define SCD(n) scanf("%d",&n)
#define SCD2(m,n) scanf("%d%d",&m,&n)
#define SCD3(m,n,k) scanf("%d%d%d",&m,&n,&k)
#define PB push_back
#define MP make_pair
#define ARSCD(A,N) REP(i,N){SCD(A[i]);}
#define ARSCD1(A,N) FORq(i,1,N){SCD(A[i]);}
#define PRINTD(n) printf("%d\n",n)
#define PRINTLLD(n) printf("%lld\n",n)
#define DEBUG printf("%s\n","debug")
#define fst first
#define snd second
using namespace std;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef long long ll;
//////////////////////////////////////////////////////
bool IsPrime(int num)
{
    if (num < 2) return false;
    else if (num == 2) return true;
    else if (num % 2 == 0) return false;

    double sqrtNum = sqrt(num);
    for (int i = 3; i <= sqrtNum; i += 2)
    {
        if (num % i == 0)
        {
            
            return false;
        }
    }
    return true;
}


int main(){
	int N; SCD(N);
	static bool win[10002];
	vector<int> primes;
	win[0] = false;
	win[1] = false;
	win[2] = false;
	win[3] = false;
	

	FORq(i,2,N){
		if (IsPrime(i)) primes.PB(i);
	}
	
	FORq(i,4,N){
		bool wini = false;
		
		REP(j,primes.size()){
			int p = primes[j];
			if (i - p <= 1) continue;
			if (!win[i-p]) wini = true;
		}
		
		win[i] = wini;
	}
	
	if (win[N]) printf("Win\n");
	else printf("Lose\n");

	
	
	return 0;
}