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,os,io,time,copy
if os.path.exists('input.txt'):
    sys.stdin = open('input.txt', 'r')
    sys.stdout = open('output.txt', 'w')

import math

def is_int(n):
    if n//1==n/1:
        return True
    else:
        return False

def main():
    # start=time.time()
    a,b,c=map(int,input().split())
    for i in range(1,10001):
        x=i
        y=a/i
        z=c/i
        if is_int(x) and is_int(y) and is_int(z) and y*z==b:
            print(4*int(x+y+z))
            break
        

    # end=time.time()
main()