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.
#from sys import stdin,stdout
#input = stdin.readline
 
def main():
    #t = int(input())
    t = 1
    for z in range(t):
        #n = int(input())
        #n,k = map(int,input().split())
        #ai = list(map(int,input().split()))
        s1,s2,s3 = map(int,input().split())
        # a * b = s1
        # b * c = s2
        # c * a = s3
        # a/c = s1/s2
        c = int((s3 * s2 / s1) ** 0.5)
        a = s3 // c
        b = s2 // c
        print((a + b + c) * 4)
main()
