def prime_game(n):
    prime_table = []
    for i in range(2, n + 1):
        is_prime = True
        for j in prime_table:
            if i < j * j:
                break
            if i % j == 0:
                is_prime = False
                break
        if is_prime:
            prime_table.append(i)
    
    dp = [True] * (n + 1)
    
    for i in range(2, n + 1):
        win = False
        for j in prime_table:
            if i < j:
                continue
            if not dp[i - j]:
                win = True
        dp[i] = win
    
    print("Win" if dp[n] else "Lose")

n = int(input())
prime_game(n)