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
class Parallelepiped:
    def __init__(self):
        self.a,self.b,self.c,self.area=None,None,None,None

    def sum12Edges(self,ab,bc,ac):
        self.b=math.sqrt((((bc+ac)/ac)/((bc+ac)/bc))*ab)
        self.a=ab/self.b
        self.c=bc/self.b
        self.area=round(4*(self.a+self.b+self.c)) 
        #round(num) takes care of rounding up/down based on num
        #if <.5 rounded down... >=.5 is rounded up
        return self.area
        
ab,bc,ac=map(int,input().split(" "))
p=Parallelepiped()
print(p.sum12Edges(ab,bc,ac))