#include <cstdio>
#include <cassert>
#include <algorithm>

using namespace std;

int solve(int e){
  int ans = e;
  for(int z = 0; z*z*z<=e; ++z){
    int r = e - z*z*z;
    for(int y = 0; y*y <= r; ++y){
      ans = min(ans, z + y + (r - y*y));
    }
  }
  return ans;
}


int main(){
  for(;;){
    int e;
    scanf("%d", &e);
    if(e == 0){break;}
    printf("%d\n", solve(e));
  }
  return 0;
}