n = int(input())

divisors = []

best_area = 1000000000

for i in range(1, n + 1):
    if n % i == 0:
        divisors.append(i)

for i in divisors:
    for j in divisors:
        if n % (i*j) == 0:
            k = n//(i*j)
            best_area = min(best_area, 2*(i*j + i*k + j*k))

print(best_area)