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(a, b, c):
    sortednums = sorted([a, b, c])
    n1 = sortednums[2]
    n2 = sortednums[1]
    n3 = sortednums[0]
    for i in range(1, n3 + 1):
        if n1 % i == 0 and n2 % i == 0:
            helper1 = n3 / i
            helper2 = n2 / i
            if ((n2 % helper1 == 0 and n1 % helper2 == 0) or (n2 % helper2 == 0 and n1 % helper1 == 0))and (helper1 * helper2 == n1):
                return [i, helper1, helper2]




answer = int(4 * sum(findCommonSide(areas[0], areas[1], areas[2])))



sys.stdout.write(str(answer))    
