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.
from math import sqrt
areas= list(map(int,input().split(' ')))
edge1 = sqrt((areas[0]*areas[1])/areas[2])*4
edge2=sqrt((areas[0]*areas[2])/areas[1])*4
edge3=sqrt((areas[2]*areas[1])/areas[0])*4
sumEdg=edge1+edge2+edge3
print(int(sumEdg))