#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <bitset>

#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <ctime>
////
//#include <random>//
#pragma endregion //#include
/////////

#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N;
	cin >> N;

	vector<int> yuki;

	for(int i=1;;++i){
		int res = (i*(i+1))/2;
		if( res > N ){
			break;
		}
		yuki.push_back( res );
	}
	int size = yuki.size();
	//////
	
	vector<int> V(N+1,INF);
	queue<int> next,now,zero;
	for(int i=0;i<size;++i){
		if( yuki[i] == N ){
			cout << 1 << endl;
			return;
		}
		V[ yuki[i] ] = 1;
		next.push( yuki[i] );
	}
	int count = 1;//4とか3ぐらい
	while(true){
		now = next;
		next = zero;
		++count;//2枚目
		cerr << count << " " << now.size() << endl;
		while(now.size()){
			int val = now.front();
			now.pop();
			for(int i=0;i<size;++i){
				int ter = val + yuki[i];
				if( ter == N ){
					cout <<count << endl;
					return;
				}
				if( ter > N ){
					break;
				}
				if( V[ter] > V[val]+1 ){
					V[ter] = V[val]+1;
					next.push( ter );
				}
			}
		}
	}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()