import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;


void main() {

    while (1) {
        int n;
        scan(n);

        if (!n) return;

        int ans = 10^^7;

        for (int z; z^^3 <= n; z++) {
            for (int y; y^^2 <= n - z^^3; y++) {
                int x = n - z^^3 - y^^2;
                ans = min(ans, x + y + z);
            }
        }

        writeln(ans);
    }
}


void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}