def findp(n):
	p = []
	for i in range(3,n):
		check = True
		for k in range(2,int(i**0.5)+2):
			if i%k == 0:
				check = False
		if check:
			p.append(i)
	p.append(2)
	return p

n = int(input())
p = findp(n)
identifier = 1
next = n - max(p)
while next != 3 and next != 2 and next != 1:
	pp = findp(next)
	next = next - max(p)
	identifier = identifier*-1
if next == 1 and identifier == 1:
	print('Lose')
elif next == 1 and identifier == -1:
	print('Win')
elif identifier == 1:
	print('Win')
else:
	print('Lose')