import math
def getPrimes(N):
	primes = []
	for i in range(2,N + 1):
		flag = False
		j = 2
		while i >= j * j:
			if i % j == 0:
				flag = True
				break
			j += 1
		if not flag:primes.append(i)
	return primes
N = int(raw_input())
primeNums = getPrimes(N)
dp = [0 for i in range(N + 1)]
dp[0] = 1
dp[1] = 1
for i in range(2,N + 1):
	for p in primeNums:
		if i < p:continue
		if(dp[i - p] == 0):
			dp[i] = 1
			break
if dp[N] == 1:
	print 'Win'
else:
	print 'Lose'