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.
input1 = [int(i) for i in input().split()]
lb = input1[0]
bh = input1[1]
lh = input1[2]
l = int(((lb*bh)/lh)**0.5)
b = int(((bh*lh)/lb)**0.5)
h = int(((lh*lb)/bh)**0.5)
ans = 4*(l + b + h)
print(ans)