def max_product(arr, n):
    if n == 0:
        return 0

    dp = arr[:]

    for i in range(n):
        for j in range(i):
            if arr[j] < arr[i]:
                candidate = dp[j] * arr[i]
                if candidate > dp[i]:
                    dp[i] = candidate

    return max(dp)