Centuries ago, the desert kingdom of Navrata was famous for its vast trade routes. Along one such route, there are n oases, each at a fixed position from the start of the route. Every oasis has a certain amount of resources stored, represented as an integer value.

Saee, a merchant caravan leader, wants to choose two oases as her main trade hubs. The profit she can earn from transporting goods between these two hubs depends on:
The distance between the two oases (in route units).


The smaller of the two resource values at those oases (since the weaker hub limits the maximum goods that can be moved).


The profit from selecting two hubs is calculated as:
distance_between_oases × minimum_resource_value_of_the_two

Your task is to determine the maximum profit Saee can earn by choosing any two oases as hubs.

A single integer — the maximum profit possible.