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
z = []
z[0:] = map(int, input().split())
z.sort()
lst1 = []
lst2 = []
lst3 = []
lst = [0,1]
for i in range(0,z[1]):
    if  i not in lst and z[0] % i == 0 and z[1] % i == 0:
        lst1.append(i)
        break

if len(lst1) == 0:
    lst1.append(1)
    lst1.append(1)
    lst1.append(1)
else:
    lst1.append(z[1] // lst1[0])
    lst1.append(z[2] // lst1[1])

print(sum(lst1) * 4)