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.

#                                 ██╗  ██╗ █████╗ ██╗     ██████╗  ███████╗ ████████╗ ██╗  ██╗ 
#                                 ██║ ██╔╝██╔══██╗██║     ██╔══██╗ ██╔════╝ ██ ╔════╝ ██║  ██║ 
#                                 █████╔╝ ███████║██║     ██║  ██║ █████╗   ████████║ ███████║ 
#                                 ██╔═██╗ ██╔══██║██║     ██║  ██║ ██╔══╝   ╔════╝██║ ██╔══██║ 
#                                 ██║  ██╗██║  ██║███████╗██████╔╝ ███████╗ ████████║ ██║  ██║ 
#                                 ╚═╝  ╚═╝╚═╝  ╚═╝╚══════╝╚═════╝  ╚══════╝ ╚══════╝╚ ═╝   ╚═╝ 

MOD = int(1e9)+7
from math import sqrt,ceil,log,log2,\
floor,gcd,pi,factorial,lcm
from collections import deque
from itertools import permutations

def solve():
  x = int(sqrt((a1*a2)/a3))
  y = a2//x
  z = a1//x
  print((x+y+z)*4)



if __name__=='__main__':
  a1,a2,a3 = map(int,input().split())
  solve()
