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 sys


areas = [int(x) for x in sys.stdin.readline().split()]

def findCommonSide(n1, n2, n3):
    for i in range(1, n1 + 1):
        if n1 % i == 0 and n2 % i == 0:
            helper1 = n1 / i
            helper2 = n2 / i
            if n2 % helper1 == 0 and n3 % helper2 == 0:
                return i


firstCommonSide = findCommonSide(areas[0], areas[1], areas[2])
secondCommonSide = (areas[1] / firstCommonSide)
thirdCommonSide = (areas[0] / firstCommonSide)

sys.stdout.write("{}     {}     {}        ".format(firstCommonSide, secondCommonSide, thirdCommonSide))

answer = int(4 * firstCommonSide + 4 * secondCommonSide + 4 * thirdCommonSide)



sys.stdout.write(str(answer))    
