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
ab,bc,ac = [int(x) for x in input().split()]
 
if ab == bc == ac:
    print(int(math.sqrt(ab)*12))
else:
    l = [ab,bc,ac]
    l = sorted(l)
    mx = math.gcd(l[0],l[2])
    my = int(l[0]/mx)
    mz = int(l[2]/mx)
    if my*mz in l:
        print((mx*4)+(my*4)+(mz*4))
    else:
        my = int(l[1]/mx)
        print((mx*4)+(my*4)+(mz*4))
