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
x,y,z = map(int,input().split())
h = math.gcd(x,y)
g = math.gcd(h,z)
x,y,z = x//g,y//g,z//g
l = [x,y,z]
s = set(l)
l = list(s)
if len(l) == 1:
    print(l[0]*12)
elif len(l) == 2:
    print(l[0]*8 + l[1]*4)
elif len(l) == 3:
    print(l[0]*4 + l[1]*4 + l[2]*4)