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.
'''input
3 3
'''
import sys
from math import *
from copy import *
from bisect import *
from collections import *
from itertools import *
from functools import *
from heapq import *
from array import array
INF = 2147483647
INF64 = 9223372036854775807
input = sys.stdin.readline
def getstr(): return input().rstrip('\r\n')
def getint(): return int(input().strip())
def getints(): return list(map(int, input().strip().split()))
def impossible(): print(-1),exit(0)
 
def solve():
	a,b,c = getints()
	x,y,z = map(round, [sqrt(a*b*c)/c, sqrt(a*b*c)/b, sqrt(a*b*c)/a])
	print(4*(x+y+z))
 
if __name__=="__main__":
	t = 1
	for i in range(t):
		solve()