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.
s1, s2, s3 = [int(x) for x in input().split()]
div = []
for i in range(1, s1 + 1):
    if s1 % i == 0:
        div.append(i)
for d in div:
    if s2 % d == 0:
        if s3 % (s2 // d) == 0:
            if s3 // (s2 // d) == s1 // d:
                print(4 * (d + s2 // d + s1 // d))
                break