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
from collections import Counter
import io,os

# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

# for _ in range(int(input())):
a, b, c = map(int, input().split())
s = math.sqrt(a*b*c)
a1 = s/a
b1 = s/b
c1 = s/c
print(int((a1+b1+c1)*4))



# for _ in range(int(input())):
# grid = [list(map(int, input().split())) for _ in range(3)]
# grid = [list(input()) for _ in range(n)]
# result = [[1] * 3 for _ in range(3)]
# n, s, r = map(int, input().split())
# arr = list(map(int, input().split()))
# n = input()
# n = int(n)