def seachPrimeNum(N):
    max = int(N ** 0.5)
    seachList = [i for i in range(2, N + 1)]
    primeNum = []
    while seachList[0] <= max:
        primeNum.append(seachList[0])
        tmp = seachList[0]
        seachList = [i for i in seachList if i % tmp != 0]
    primeNum.extend(seachList)
    return primeNum


N = int(input())
PL = seachPrimeNum(N)
dp = [False] * (N + 1)
dp[0] = True
dp[1] = True
for i in range(2, N + 1):
    for p in PL:
        if i < p:
            break
        if dp[i - p] == False:
            dp[i] = True
            break
print(["Lose", "Win"][dp[N]])