prime=[]
for i in range(2,10000):
    judge=0
    for j in range(2,100):
        if i==j:
            break
        if i%j==0 :
            judge+=1
            break
    if judge==0:
        prime.append(i)
        
def minus(n):
    Q=[[] for i in range(n+10)]
    judge=[1 for i in range(n+10)]
    judge[2]=-1
    judge[3]=-1
    for i in range(2,n+1):
        count=0
        for p in prime:
            if i-p<=1:
                break
            else:
                Q[i].append(i-p)
        for q in Q[i]:
            if judge[q]==-1:
                count+=1
        if count==0:
            judge[i]=-1
    if judge[n]==-1:
        return "Lose"
    else:
        return "Win"
                
    
N=int(input())
print(minus(N))