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.
from math import sqrt
from sys import stdin, stdout
faces = list(map(int, stdin.readline().strip().split()))

a, b, c = sqrt((faces[0]*faces[2])//faces[1]), sqrt((faces[0]
                                                     * faces[1])//faces[2]), sqrt((faces[1]*faces[2])//faces[0])
res = int(4*(a+b+c))

stdout.write(f"{res}")
