#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

vector<ll> coins;

int main() {

	int n = 0;
	cin >> n;

	int k = 1;

	int goukei=1;

	while (goukei <= n) {

		coins.push_back(goukei);
		k++;
		goukei = k * (k + 1) / 2;

	}

/*
	for(int i=0; i<coins.size(); i++){
		cout<<coins[i]<<endl;
	}
*/

	int a =100000000;
	for (int i = coins.size()-1; i >= 0; i--) {
		int sum = n;

		int ans = 0;

	/*	cout<<coins[i];
		return 0;
*/
		ans = sum / coins[i];

		sum = sum % coins[i];


		for (int j = i - 1; j >= 0; j--) {

		/*	cout<<coins[j]<<endl;*/
			if( sum / coins[j] !=0){
				ans += sum / coins[j];

				sum = sum % coins[j];

				/*cout<<ans<<" "<<sum<<endl;*/
			}

		}



		a = min(a,ans);



	}

	cout<<a<<endl;
}