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.
#  map(int, input().split())
#  list(map(int, input().split()))

areas = list(map(int, input().split()))
areas.sort()
b = True
for a in range(1,areas[0] + 1):
    for b in range(1,areas[1] + 1):
        for c in range(1,areas[2] + 1):
            temp = []
            temp.append(a * b)
            temp.append(b * c)
            temp.append(a * c)
            temp.sort
            if temp == areas:
                print((a * 4) + (b * 4) + (c * 4))
                b = False
            else:
                pass
            if b:
                pass
            else:
                break
        if b:
            pass
        else:
            break
    if b:
        pass
    else:
        break