#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
int n;
vector<int> vec;

int main(){
	cin >> n; int a=1;
	while(a*(a+1)/2<=n) vec.push_back(a*(a+1)/2),a++;
	
	int cou=0;
	while(n){
		int c=0,pos=0;
		while(vec[c]<=n and c<vec.size()){
			if(!(n%vec[c])) pos=c;
			c++;
		}
		c--;
		
		if(pos){cout << cou+n/vec[pos] << endl; return 0;}
		else n-=vec[c],cou++;
	}
	
	cout << cou << endl;
	return 0;
}