# -*- coding: utf-8 -*-
N = int(input())
isPrime = [True] * (N + 1)

#エラトステネスの篩
for i in range(2,N + 1) :
    if isPrime[i]:
        for j in range(2 * i,N + 1,i):
            isPrime[j]=False
            
dp = [-1] * (N + 1)
def grundy(x):
    #計算済みの場合
    if dp[x] == 0 :
        return dp[x]
    #2、または3を渡されたら負け
    if x == 2 or x == 3:
        dp[x] = 0
        return dp[x]
    
    lst = []
    for i in range(2,x+1):
        
        if isPrime[i] and x-i >= 2:
            lst.append(grundy(x-i))
        
    dp[x] = sum(lst)
    return dp[x]

res = grundy(N)
if res==0:
    print("Lose")
else:
    print("Win")