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.
import sys
import math
import copy
from collections import deque
from collections import *

input = lambda: sys.stdin.readline().rstrip("\r\n")


def ll(): return list(map(int, input().split()))


def lf(): return list(map(float, input().split()))


def ls(): return list(map(str, input().split()))


def mn(): return map(int, input().split())


def nt(): return int(input())


def ns(): return input()
a,b,c=mn()
print(int(4*(pow(a*b/c,0.5)+pow(a*c/b,0.5)+pow(b*c/a,0.5))))