Neboder(1000)

Jambaxx wants to find a rectangle as large as possible in a city with many skyscrapers arranged in a line. If there are multiple such rectangles, choose the one with minimum max(width,height)/min(width,height). If there are still multiple possible rectangles, choose the one with the leftmost edge being as far left as possible. If there are still multiple solutions, choose the one with the smallest height.

Input: N, the number of skyscrapers and the height of each skyscraper.

Output: The area of the largest rectangle, the index of the leftmost skyscraper it passes through and the height and the width.