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
a,b,c = map(int,input().split())
if(a == b and b == c):
    print(12*int(a**0.5))
else:
    s = 0
    if(a != b):
        g = math.gcd(a,b)
        s += g
        s += a//g + b//g
        print(4*s)
    elif b != c:
        g = math.gcd(c,b)
        s += g
        s += c//g + b//g
        print(4*s)
    else:
        g = math.gcd(a,c)
        s += g
        s += a//g + c//g
        print(4*s)
