#include <bits/stdc++.h>

using namespace std;

int dp[10000001];

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;

	cin >> n;

	vector <int> v;

	for(int i=1; ;i++)
	{
		int val = i*(i+1)/2;
		if(val > n) break;
		v.push_back(val);
	}

	memset(dp,-1,sizeof(dp));

	dp[0] = 0;
	queue <int> que;
	que.push(0);

	sort(v.rbegin(),v.rend());
	while(!que.empty())
	{
		int now = que.front();
		que.pop();

		if(now==n)
		{
			cout << dp[now] << '\n';
			break;
		}

		for(int i=0;i<v.size();i++)
		{
			int next = now + v[i];
			if(next > n) continue;
			if(dp[next]==-1)
			{
				dp[next] = dp[now] + 1;
				que.push(next);
			}
		}
	}
	return 0;
}