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.
import math

def calculate_edge_lengths(A, B, C):
    edge_1 = math.sqrt(A * C / B)
    edge_2 = math.sqrt(A * B / C)
    edge_3 = math.sqrt(B * C / A)
    return edge_1, edge_2, edge_3

def main():
    A, B, C = map(int, input().split())
    
    edge_1, edge_2, edge_3 = calculate_edge_lengths(A, B, C)
    
    sum_of_edges = 2 * (edge_1 + edge_2 + edge_3)
    print(sum_of_edges)

if __name__ == "__main__":
    main()