You've got a rectangular parallelepiped with integer edge lengths. You know the areas of its three faces that have a common vertex. Your task is to find the sum of lengths of all 12 edges of this parallelepiped.
The first and the single line contains three space-separated integers — the areas of the parallelepiped's faces. The area's values are positive ( &gt; 0) and do not exceed 10<sup class="upper-index">4</sup>. It is guaranteed that there exists at least one parallelepiped that satisfies the problem statement.
import math

n = int(input())
height = list(map(int, input().strip().split()))

unit = [0, 0]
min = abs(height[1] - height[0])

for i in range(1, n):
    if abs(height[i] - height[i - 1]) <= min:
        min = height[i] - height[i - 1]
        unit = [i, i - 1]
    if abs(height[-1] - height[0]) <= min:
        min = height[0] - height[-1]
        unit = [1, n]
    
print(unit[0], unit[1])