#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int mi[10101010];
vector<int> V;
map<int,int> M[10101010];

int hoge(int N) {
	int ret=0;
	FORR(c,V) while(N>=c) ret++, N-=c;
	return ret;
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	for(i=1;i<=3200;i++) V.push_back(i*(i+1)/2);
	
	cin>>N;
	int ret=10101010;
	FORR(x,V) {
		if(x==N) ret=1;
		FORR(y,V) {
			if(x+y<=N) ret=min(ret,2+(N-x-y));
		}
	}
	if(ret>3) ret=3;
	cout<<ret<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}