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
import sys

def main():
    s1,s2,s3 = map(int,input().split())
    for a in range(1, max(s1,s2,s3) + 1):
        if s3 % a == 0 and (s1 % (s3//a) == 0) and (a*(s1//(s3//a)) == s2):
            c = s1//(s3//a)
            b = s3//a
            return (c * 4) + (4 * a) + (4 * b)






print(main())