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.
import sys
from os import path
if (path.exists('input.txt')):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt','w')

a,b,c = map(int, input().split())
x = int(((a*c)/b)**(0.5))
y = int(((a*b)/c)**(0.5))
z = int(((b*c)/a)**(0.5))
print(4*(x+y+z))