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
lst =[int (x) for x in input().split()]
st = list(set(lst))
if(len(st)==1):
    sq = int(math.sqrt(lst[0]))
    s = 12*sq 
else:
    c1=lst.count(st[0])
    c2=lst.count(st[1])
    if(c1==1):
        a = int(math.sqrt(st[0]))
        b = int(st[1]/a)
    else:
        a = int(math.sqrt(st[1]))
        b = int(st[0]/a)
    s = 8*a+4*b 
print(s)