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 gcd(a,b):
    if b==0:
        return a
    return gcd(b,b%a)

def lcm(a,b):
    return a*b//gcd(a,b)

first,second,third=map(int,input().split())


common=lcm(gcd(first,second),third)

side1=first//common
side2=second//common
side3=third//common

width=min(side1,side2,side3)
length=max(side1,side2,side3)

print(4*length+8*width)