#include "bits/stdc++.h"
using namespace std;
     
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
     
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll, ll>
const int inf = 1000000001;
const ll INF = 1e18;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<<fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

#define P complex<double>

// 許容する誤差ε
#define EPS (1e-8)
// 2つのスカラーが等しいかどうか
#define EQ(a,b) (abs((a)-(b)) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )


// 外積 (cross product) : a×b = |a||b|sinΘ
double cross(P a, P b) {
	return (a.real() * b.imag() - a.imag() * b.real());
}

// a1,a2を通る直線とb1,b2を通る直線の交点計算
P intersection_l(P a1, P a2, P b1, P b2) {
	P a = a2 - a1; P b = b2 - b1;
	return a1 + a * cross(b, b1 - a1) / cross(b, a);
}

bool judge(vector<double> x, vector<double> y, double t) {
  vector<double> nowx(3);
  for (int i = 0; i < 3; i++) {
    nowx[i] = x[i] + t * y[i];
  }
  if (EQ(nowx[0], nowx[1]) || EQ(nowx[1], nowx[2]) || EQ(nowx[0], nowx[2])) {
    return false;
  }
  if ((nowx[1] - nowx[0]) * (nowx[1] - nowx[2]) > 0) {
    return true;
  }
  else {
    return false;
  }
}


int main() {
  int n, i, j;
  cin >> n;
  vi money;
  i = 1;
  while (i * (i + 1) / 2 <= n) {
    money.push_back(i * (i + 1) / 2);
    i++;
  }
  money.push_back(inf);
  //DEBUG_VEC(money);
  vi dp(n + 1, inf);
  dp[0] = 0;
  for (i = 0; i < money.size() - 1; i++) {
    for (j = 0; j + money[i] <= min(n, money[i + 1]); j++) {
      dp[j + money[i]] = min(dp[j + money[i]], dp[j] + 1);
    }
  }
  cout << dp[n] << endl;
    
    
}