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.
a, b, c = input().strip().split(' ')
a, b, c = [int(a), int(b), int(c)]

flag = False
l = 0
w = 0
h = 0
for l in range(0,101):
    for w in range(0,101):
        for h in range(0,101):
            a1 = l * w
            a2 = w * h
            a3 = h * l
            if a1 == a and (a2 == b and a3 == c or a2 == c and a3 == b):
                flag = True
                break
            elif a1 == b and (a2 == a and a3 == c or a2 == c and a3 == a):
                flag = True
                break
            elif a1 == c and (a2 == b and a3 == a or a2 == a and a3 == b):
                flag = True
                break
        if flag:
            break
    if flag:
        break

print(4 * (l + w + h))