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 Apr 30 23:19:30 2020

@author: Administrator
"""
def gcd(x,y):
    if x<y:
        y,x = x,y
    while(y): 
       x, y = y, x % y 
    return x 

x,y,z = map(int,input().split())
a = gcd(x,y)
b = x//a
c = y//b

print(4*(a+b+c))

#print(gcd(48,60))