def max_product(arr, n):
    if n == 0:
        return 0
    
    # dp[i] = maximum product of increasing subsequence ending at index i
    dp = [0] * n
    
    for i in range(n):
        dp[i] = arr[i]
        for j in range(i):
            if arr[j] < arr[i]:
                dp[i] = max(dp[i], dp[j] * arr[i])
    
    return max(dp)