N = int(raw_input())

prime = []
good = [True] * 10101

for i in xrange(2, 10101):
	if good[i]:
		prime.append(i)
		for j in xrange(i * i, 10101, i):
			good[j] = False

memo = [None] * 10101

def judge(n):
	global memo
	if n <= 1: return True
	if not memo[n] is None: return memo[n]
	memo[n] = any([not judge(n - p) for p in prime if p <= n])
	return memo[n]

if judge(N):
	print "Win"
else:
	print "Lose"