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.
def main():
    s1, s2, s3  = list(map(int, input().split(" ")))

    for a in range(1, 101):
        for b in range(1, 101):
            for c in range(1, 101):
                if a*b == s1 and a*c == s2 and b*c == s3:
                    print(4*a + 4*b + 4*c)
                    return

    

if __name__ == "__main__":
    main()
