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.
# https://codeforces.com/problemset/problem/224/A

s1, s2, s3 = map(int, input().split())
a = ((s1*s3)/s2) ** 0.5
b = ((s1*s2)/s3) ** 0.5
c = ((s2*s3)/s1) ** 0.5
print(4*int(a+b+c))
