n = int(input())
ansmi = n
for j in range(2,61):
    def is_ok(arg):
        return arg**j <= n
    def meguru_bisect(ng, ok):
        while (abs(ok - ng) > 1):
            mid = (ok + ng) // 2
            if is_ok(mid):
                ok = mid
            else:
                ng = mid
        return ok
    i = meguru_bisect(10**18+1,0)
    k = n-i**j
    if ansmi > i+j+k:
        ansmi = i+j+k

print(ansmi)