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 *
'''sys.stdin = open('input.txt', 'r')  
sys.stdout = open('output.txt', 'w') '''
from collections import defaultdict as dd
from math import *
from bisect import *
#sys.setrecursionlimit(10 ** 8)
def sinp():
    return input()
def inp():
    return int(sinp())
def minp():
    return map(int, sinp().split())
def linp():
    return list(minp())
def strl():
    return list(sinp())
def pr(x):
    print(x)
mod = int(1e9+7)
def factor(n):
    res = []
    i = 1
    while i <= sqrt(n):
        if n % i == 0:
            if n // i == i:
                res.append(i)
            else:
                res.extend([i, n // i])
        i += 1
    return res
def lcm(a, b, c):
    x = a * b // gcd(a, b)
    return x * c // gcd(x, c)
a, b, c = minp()
l = lcm(a, b, c)
res = factor(l)
pr(1 * 4 + res[-1] * 4 + l // res[-1] * 4)