// 想定WA解法(貪欲)
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int solve(int n) {

  vector<int> T;
  for (int t, i = 1; (t = i * (i + 1) / 2) <= n; i++) {
    T.emplace_back(t);
  }

  int ans = 0;

  while (n) {
    int t = T.back(); T.pop_back();
    int d = n / t;
    n -= d * t;
    ans += d;
  }

  return ans;
}

int main() {
  int n;
  cin >> n;
  cout << solve(n) << endl;
}