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 sys import stdin
from itertools import cycle
input = stdin.readline
one, two, three = map(int, input().split())
y = int((one*two/three)**0.5)
x = int((one*three/two)**0.5)
z = int((three*two/one)**0.5)

print((x+ y +z)*4)
