#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<pii> v; // sum, cnt
	vector<int> cnt(N + 1, INF);
	vector<int> pred;
	cnt[0] = 0;
	for (int i = 1; (1 + i) * i / 2 <= N; ++i) {
		const int s = (1 + i) * i / 2;
		pred.emplace_back(s);
		cnt[s] = 1;
	}
	for (int i : pred) for (int j : pred) if (i + j <= N) chmin(cnt[i + j], 2);
	int ans = cnt[N];
	for (int i : pred) chmin(ans, 1 + cnt[N - i]);
	for (int i : pred) for (int j : pred) if (i + j <= N) chmin(ans, 2 + cnt[N - i - j]);
	cout << ans << endl;
}