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.
l = input().split(' ')
A1, A2, A3 = int(l[0]), int(l[1]), int(l[2])
"""
Up: A1 = a * b
front: A2 = b * c
side: A3 = a * c

A1/A2 = a/c
A2/A3 = b/a
A1/A3 = b/c
"""
c_found = 1
for c in range(1, 101):
    a = int((A1/A2) * c)
    b = int(A1 / a)
    if b/c == A1/A3 and A1/A2 == a/c and A2/A3 == b/a:
        c_found = c
        break
print(4*(a+b+c_found))
