import math
def sieve (n):
	check = [True]*(n+1)
	check[0] = check[1] = False
	for d in xrange(2,int(math.sqrt(n))+1):
		if not check[d]: continue
		for comp in xrange(d*2,n+1,d):
			check[comp] = False
	return [i for i in xrange(2,n+1) if check[i]]
N = input(); memo = [None]*(N+1); prime = sieve(N)
memo[0] = memo[1] = True
def dfs(n):
	if memo[n] is None:
		tmp = False
		for p in prime:
			if p > n: continue
			tmp |= not dfs(n-p)
		memo[n] = tmp
	return memo[n]
print "Win" if dfs(N) else "Lose"