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.
# with open("input.txt",'r') as f:
# 	t = int(f.readline().rstrip())
# 	# n = int(f.readline().rstrip())
	# n ,a,b   = int(f.readline().rstrip().split())
# 	# arr = list(map(int,f.readline().rstrip().split()))



def gcd(a,b):
	if b==0:
		return a 
	else:
		return gcd(b,a%b)


def main(x,y,z):
# x,y,z = map(int,input().split())
	a1 = gcd(x,y)
	a2 = gcd(x,z)
	a3 = y//a1
	ans = (a1*4) + (a2*4)+(a3*4)
	print(ans)

x,y,z = map(int,input().split())
main(x,y,z)