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
#s = input()
#n= (map(int, input().split()))

#(map(int, input().split()))


#a, b = (map(int, input().split()))

#t = int(input())

#for i in range(0, t):

s1, s2, s3 = (map(int, input().split()))
a = pow(s1*s2//s3,0.5)
print(int(4*(a + s1//a + s2//a)))

























