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.
# Problem Link: https://codeforces.com/problemset/problem/224/A
# Author: Raunak Sett
import sys
import math
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__

# do magic here

a, b, c = map(int, input().split())

side1 = int(math.sqrt(a*b/c))
side2 = int(math.sqrt(a*c/b))
side3 = int(math.sqrt(b*c/a))

s = side1 + side2 + side3
print (4 * s)

