#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };
 
int memo[10101010];

int	rec(int n){
	if (n == 0)return 0;
	if (memo[n] != -1)return memo[n];

	int temp = 10101010;
	for (int i = 1; i*(i + 1) / 2 <= n; i++) {
		temp = min(temp,rec(n - i*(i+1)/2)+1);
	}
	return memo[n] = temp;
}



int main() {
	int n;
	cin >> n;

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

	cout << rec(n) << endl;
	
	return 0;
}