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

n = input()

stack = n.split(" ")

a = math.sqrt(int(stack[0])*int(stack[2])/int(stack[1]))
b = math.sqrt(int(stack[0])*int(stack[1])/int(stack[2]))
c = math.sqrt(int(stack[1])*int(stack[2])/int(stack[0]))

print(int(4*(a+b+c)))

