codeforces224A

http://codeforces.com/problemset/problem/224/A

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 104. 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.

方程求解；

#include <stdio.h>#include <math.h>using namespace std;int main(){    int a,b,c;    while(~scanf("%d%d%d",&a,&b,&c))    {        int x=sqrt((double)a/c*b);        int y=a/x;        int z=c/y;        printf("%d\n",4*(x+y+z));    }    return 0;}