def primes(n): lst = [2] for i in xrange(3, n+1): for j in xrange(len(lst)): if i%lst[j]==0: break if i<=lst[j]**2: lst.append(i) break return lst n = int(raw_input()) p = primes(n) dp = [0] * (n+1) dp[0]=1 dp[1]=1 for i in xrange(2, n+1): for j in xrange(len(p)): if i < p[j]: break if dp[i-p[j]]==0: dp[i]=1 break if dp[n]==0: print "Lose" else: print "Win"