n = int(input())

def is_power_exceeding(i, j, n):
    result = 1
    for _ in range(j):
        result *= i
        if result > n:
            return True
    return False

min_sum = n  # Initialize with j=0 case

max_j = 60  # Since log2(1e18) is about 60

for j in range(2, max_j + 1):
    low = 1
    high = n
    best_i = 1
    while low <= high:
        mid = (low + high) // 2
        if is_power_exceeding(mid, j, n):
            high = mid - 1
        else:
            best_i = mid
            low = mid + 1
    # Calculate best_i^j
    power = 1
    for _ in range(j):
        power *= best_i
    k = n - power
    current_sum = best_i + j + k
    if current_sum < min_sum:
        min_sum = current_sum

print(min_sum)