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.

"""
Created on Mon Jul  6 21:28:12 2020

@author: rishi
"""
import math

def sumofno(n):
    summ=0
    while(n>0):
        summ+=n%10
        n//=10
    return summ

def get_key(val,lis): 
    for key, value in lis.items(): 
         if value == val : 
             return key 

def isprime(val):
    c=0
    for j in range(2,val):
        if(val%j)==0:
            return False
    return True
            
#print(isprime(15))
try:
    #t=int(input())
    ans=[]
    
    for i in range(1):
        #n=input()
        #n=int(n)
        a,b,c=list(map(int,input().split()))
        
        area=(a*b*c)**(0.5)
        h=area//a
        l=area//b
        br=area//c
        ans.append(int(4*(h+l+br)))
        
        
        
            
        
            
            
            
        
       
                    
                
                
                
                
        
    #print (ans)
    for an in ans:
        #print("hi")
        print(an)

except:
    pass
            