#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;


vector<int> v;
int dp[10000005];

int dfs(int N){
  if(N == 0) return 0;
  if(N < 0) return 10000000;
  if(dp[N]>0) return dp[N];
    
  int mn = 10000000;
  rep(i,v.size()){
    if(N < v[i]) break;
    mn = min(mn, dfs(N-v[i]) + 1);
  }
  return dp[N] = mn;
}


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


  {
    int k = 1;
    while(true){
      ll x = k * (ll)(k+1) / 2;
      v.push_back(x);
      if(x > N) break;
      k++;
    }
  }

  cout << dfs(N) << endl;
  
  return 0;
}