For this Question: Power Rangers have to trap a evil spirit monster into a cuboid shape box with dimensions A*B*C, where A, B and C are positive integers. The volume of the box should be exactly X cubic units (that is A*B*C should be equal to X). To allow minimum evil aura to leak from the box the surface area of the box should be minimized. Given X, find the minimum surface area of the optimal box.The first and the only line of input contains a single integer X.

Constraints:
1 <= X <= 1000000Print the minimum surface area of the optimal box.Sample Input 1
125

Sample Output 1
150

Explanation: Optimal dimensions are 5*5*5.

Sample Input 2
100

Sample Output 1
130

Explanation: Optimal dimensions are 5*4*5., I have written this Solution Code: m =int(input())
def print_factors(x):
    factors=[]
    for i in range(1, x + 1):
        if x % i == 0:
            factors.append(i)
    return(factors)
area=[]
factors=print_factors(m)
for a in factors:
    for b in factors:
        for c in factors:
            if(a*b*c==m):
                area.append((2*a*b)+(2*b*c)+(2*a*c))
print(min(area)), In this Programming Language: Python, Now tell me if this Code is compilable or not?