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.
#include <bits/stdc++.h>
using namespace std;

int main() {
    int a1,a2,a3;
    cin>>a1>>a2>>a3;
    
    int l,b,h;
    h = sqrt(a2*a3/a1);
    l = a3/h; 
    b = a1/l;
    
    cout<<l*4+b*4+h*4;
    return 0;
}