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

def findEdges(s1, s2, s3):

	# to calculate the length of one edge
	a = math.sqrt(s1 * s2 // s3)
	b = math.sqrt(s3 * s1 // s2)
	c = math.sqrt(s3 * s2 // s1)
	sum=a+b+c
	return 4 * sum

lis=list(map(int,input().split()))
s1=lis[0]
s2=lis[1]
s3=lis[2]
k=findEdges(s1,s2,s3)
print(int(k))


