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.
# countx,county,countz = 0,0,0

# for _ in range(int(input())):
x,y,z = map(int,input().split())
x,y,z = (x*y)/z,(y*z)/x,(x*z)/y
x,y,z = int(x**0.5),int(y**0.5),int(z**0.5)

sum = (x+y+z)*4
print(sum)
