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.
# I'm stupid x1

ab, bc, ca = map(int, input().split())

import math
abc = math.sqrt(ab * bc * ca)

a = abc // bc
b = abc // ca
c = abc // ab

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