#include <iostream>
#include <algorithm>

using namespace std;

const int N = 4510;

int n, a[N], cnt, idx;

int main() {
    for (int i = 1; i < N; ++i) {
        a[i] = i * (i + 1) / 2;
    }
    scanf("%d", &n);
    cnt = 0;
    while (n > 0) {
        idx = upper_bound(a + 1, a + N + 1, n) - a;
        n -= a[idx - 1];
        ++cnt;
    }
    printf("%d\n", cnt);

    return 0;
}