#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    vector<int> money(1, 1);
    int k = 2;
    while((ll)k * (k + 1) / 2 <= N){
        money.emplace_back(k * (k + 1) / 2);
        ++k;
    }
    int n = money.size(), ans = INF;
    for(int i = n - 1; i >= 0; --i){
        int cnt = N / money[i];
        int rest = N - money[i] * cnt;
        while(rest > 0){
            int j = prev(upper_bound(begin(money), end(money), rest)) - begin(money);
            cnt += rest / money[j];
            rest -= rest / money[j] * money[j];
        }
        chmin(ans, cnt);
    }
    cout << ans << '\n';

    return 0;
}