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.
f1, f2, f3 = map(int, input(). strip(). split())
flag = 0
array = []
a = 0
b = 0
c = 0
for i in range(1,f1+1):
    for j in range(1,f1+1):
        if i*j == f1:
            list = [i,j]
            array.append(list)
for ele in array:
    for c in range(1,max(f2,f3)+1):
        if ele[1]*c == f2 and ele[0]*c == f3:
            a = ele[0]
            b = ele[1]
            flag = 1
            break
    if flag ==1:
        break

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