#OJ1181. lelepiped

lelepiped

lelepiped

Time Limit: 1 Sec  Memory Limit: 128 MB

Description

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. There are a lof of cases,please use EOF to end;

Output

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. There are a lof of cases,please use EOF to end;

Sample Input

1 1 1
4 6 6

Sample Output

12
28

HINT

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

Append Code

Source