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 reducedfraction(d):
 
    # function that converts a rational number
    # to the reduced fraction
    l = d.as_integer_ratio()
 
    # reduced the list that contains the fraction
    return l
li=[]    
li=list(map(int,input().split()))
li.sort()
s=reducedfraction((li[1]/li[0]))
s2=reducedfraction((li[2]/li[0]))

ans=4*(s[0]+s[1]+s2[1])
print(ans)
