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;
#define ll long long
#define ff double
#define endl "\n"
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i=a; i<b; i++)

int main() {
	ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif

  ll a,b,c;
  cin>>a>>b>>c;
  ll ans = 4*(sqrt(a*b/c)+sqrt(b*c/a)+sqrt(a*c/b));
  cout<<ans;


#ifndef ONLINE_JUDGE
	cout << "\nTime Elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " sec\n";
#endif
	return 0;
}