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

arr = list(map(int, input().rstrip().split()))

area1 = arr[0]
area2 = arr[1]
area3 = arr[2]

t = 0
s = set(arr)
if len(s) == 1:
    print(sum(s) * 12)

else:
    a = min(s)//2
    b = max(s)//2
    print(a * 8 + b * 4)
