def Prime(n):
  prime=[True]*(n+1)
  prime[0],prime[1]=False,False
  for p in range(2,n+1):
    if not prime[p]:continue
    for np in range(2*p,n+1,p):
      prime[np]=False
  
  prime_list=[]
  for p in range(n+1):
    if prime[p]:
      prime_list.append(p)
  return prime_list

n=int(input())
P=Prime(n)

dp=[-1]*(n+1)
def grundy(x):
    if dp[x]!=-1:return dp[x]
    if x==2 or x==3:return 0
    
    s=set()
    for p in P:
        if x-p>=2:
            s.add(grundy(x-p))
        
    res=0
    while res in s:
        res+=1
    
    dp[x]=res
    return res

print('Win' if grundy(n) else 'Lose')