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.
# It's all about what U BELIEVE
def gint():
    return int(input())
def gint_arr():
    return list(map(int, input().split()))
def gfloat():
    return float(input())
def gfloat_arr():
    return list(map(float, input().split()))
def pair_int():
    return map(int, input().split())
#############################################
INF = (1 << 31)
#############################################
#############################################
x, y, z = gint_arr()

sum = round(pow(x * z / y, 0.5) + pow(x * y / z, 0.5) + pow(y * z / x, 0.5))
print(sum * 4)
