A. Parallelepiped

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

The first and the single line contains three space-separated integers — the areas of the parallelepiped's faces. The area's values are positive ( > 0) and do not exceed 10⁴. It is guaranteed that there exists at least one parallelepiped that satisfies the problem statement.

Output

Print a single number — the sum of all edges of the parallelepiped.

Sample test(s)

input

1 1 1

output

12

input

4 6 6

output

28

Note

In the first sample the parallelepiped has sizes 1 × 1 × 1, in the second one — 2 × 2 × 3.

解题说明：此题就是求立方体的十二条边之和，给的条件是三个不同面的面积，说白了就是求解一个方程组而已

a*b=s1

b*c=s2

a*c=s3

给你s1, s2 s3，求4*(a+b+c)

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
	int s1,s2,s3;
	double a,b,c;
	scanf("%d %d %d",&s1,&s2,&s3);
	b=sqrt((double)s1*s2/s3);
	a=b*s3/s2;
	c=(double)s2/b;
	printf("%.0lf\n",4*(a+b+c));

	return 0;
}