#include int tri(int k) { int num = k * (k + 1) / 2; return num; } int min(int a,int b){ int tmp=a; if(a>b){ tmp=b; } return tmp; } int main(void) { int N; int ans=3; scanf("%d", &N); //1つか2つの三角数のどちらであるかを判定 for(int k=1;tri(k)<=N;k++){ if (N == tri(k)) { ans = 1; break; } int tmp = N-tri(k); for(int m=k;tri(m)<=tmp;m++){ if (tri(m) == tmp) { ans = min(2,ans); break; } } } printf("%d\n",ans); return 0; }