#include<bits/stdc++.h>
using namespace std;
int nums;
int m[169000],now1,now2,now3;
int dfs(int n,int sum,int ans)
{
	if(sum==nums)
	{
		m[sum]=ans;
		return ans;
	}
	if(sum>nums||pow(n,4)<=0)
	{
		m[sum]=INT_MAX;
		return INT_MAX;
	}
	if(sum<nums)
	{
		if(m[sum+int(pow(n,4))]!=0)
		{
			now1=m[sum+int(pow(n,4))];
			if(m[sum]!=0)
			{
				now2=m[sum];
				return min(min(now1,now2),dfs(n,sum+pow(n,4),ans+1));
			}
			else 
			{
				return min(min(now1,dfs(n-1,sum,ans)),dfs(n,sum+pow(n,4),ans+1));
			}
		
		}
		else
		{
			return min(min(dfs(n-1,sum+pow(n,4),ans+1),dfs(n-1,sum,ans)),dfs(n,sum+pow(n,4),ans+1));
		}
	}
}
int main()
{
	cin>>nums;
	cout<<dfs(int(sqrt(int((sqrt(nums))))),0,0);
	return 0;
}