from math import sqrt, ceil

def era_prime(N):
    temp = [True]*(N+1)
    temp[0] = temp[1] = False
    for i in range(2, ceil(sqrt(N+1))):
        if temp[i]:
            temp[i+i::i] = [False]*(len(temp[i+i::i]))                            
    primes = [ n for n in range(N+1) if temp[n] ]
    return primes



n = int(input())
table = {0: True, 1: True}
primes = era_prime(n)

for i in range(2, n+1):
	# 自分以外の素数を引く
	tmp = [not table[i-x] for x in primes if x <= i]
	table[i] = True if any(tmp) else False

ans = 'Win' if table[n] else 'Lose'
print(ans)