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

    max_products = arr[:]
    best = arr[0]

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

    return best