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.
# -*- coding: utf-8 -*-
"""
Created on Thu Aug 20 05:56:07 2020

@author: Tanmay
"""

# -*- coding: utf-8 -*-
"""
Created on Thu Aug 20 05:46:37 2020

@author: Tanmay
"""

def hcfnaive(a,b): 
    if(b==0): 
        return a 
    else: 
        return hcfnaive(b,a%b)
    
arr=list(map(int,input().strip().split()))
arr=sorted(arr, reverse=True)
a1=hcfnaive(arr[0],arr[-1])
b=arr[0]/a1
c=arr[-1]/a1
ans=4*(a1+b+c)
print(int(ans))