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.
a = list(map(int,input().split()))
a.sort()
x1 = a[0]
x2 = a[1]
rat = x2/x1
prod = rat*x2
i = 1
length = (prod)**(0.5)
breadth =  x2/length
t = min(length,breadth)
ht = x1/t

for i in range(3):
    if(a[i]**(0.5)==ht):
        sq = ht
        nsq = length
        break
    elif(a[i]**(0.5)==length):
        sq = length
        nsq = ht
print(int(8*sq + nsq*4))

