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.
x, y, z = map(int, input().split())
found = False
a = 0
while found == False:
    a += 1
    if x % a == 0 and z % a == 0:
        b = x//a
        c = z//a
        if b * c == y:
            found = True
print((a*4)+(b*4)+(c*4))