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.
def h(a,b):
    ans = 0
    for i in range(1,min(a,b)+1):
        if(a%i==0 and b%i==0):
            ans = i
            # print(i)
    return ans
a,b,c = map(int,input().split())
s = []
f = h(a,b)
se = h(a,c)
t = b//se
s.append(f)
s.append(se)
s.append(t)
# s.append(a//f)
print(sum(s)*4)