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(10000 + 1)]
dp[0] = 0
dp[1] = 0
dp[2] = 1
dp[3] = 1
'''
dp[4] = 2
dp[5] = 2
dp[6] = 2
dp[7] = 2
dp[8] = 2
dp[9] = 2
dp[10] = 2
dp[11] = 3
dp[12] = 3
dp[13] = 2
dp[14] = 2
dp[15] = 2
dp[16] = 2
dp[17] = 3
dp[18] = 3
dp[19] = 2'''
for i in range(3,N + 1):
	for p in primeNums[::-1]:
		if i < p:continue
		if i == p:continue
		if i == p + 1:continue
		dp[i] = dp[i - p] + 1
		break
if dp[N] % 2 == 0:
	print 'Win'
else:
	print 'Lose'