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:
    if ab != bc:
        b = math.gcd(ab,bc)
        a = ab/b
        c = bc/b
        print(int((a*4)+(b*4)+(c*4)))
    elif bc != ac:
        c = math.gcd(bc,ac)
        b = bc/c
        a = ac/c
        print(int((a*4)+(b*4)+(c*4)))
    elif ab != ac:
        a = math.gcd(ab,ac)
        b = ab/a
        c = ac/a
        print(int((a*4)+(b*4)+(c*4)))




