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 math


class Code:
    def __init__(self):
        self.a, self.b, self.c = list(map(int, input().split()))

    def process(self):
        a = math.ceil(math.sqrt((self.a * self.b) / self.c))
        b = math.ceil(math.sqrt((self.a * self.c) / self.b))
        c = math.ceil(math.sqrt((self.b * self.c) / self.a))
        print(4 * (a + b + c))


if __name__ == '__main__':
    code = Code()
    code.process()
