#include "bits/stdc++.h" using namespace std; #define DEBUG(x) cout<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair const int inf = 1000000001; const ll INF = 1e18; #define MOD 1000000007 #define mod 1000000009 #define pi 3.14159265358979323846 #define Sp(p) cout< // 許容する誤差ε #define EPS (1e-8) // 2つのスカラーが等しいかどうか #define EQ(a,b) (abs((a)-(b)) < EPS) // 2つのベクトルが等しいかどうか #define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) ) // 外積 (cross product) : a×b = |a||b|sinΘ double cross(P a, P b) { return (a.real() * b.imag() - a.imag() * b.real()); } // a1,a2を通る直線とb1,b2を通る直線の交点計算 P intersection_l(P a1, P a2, P b1, P b2) { P a = a2 - a1; P b = b2 - b1; return a1 + a * cross(b, b1 - a1) / cross(b, a); } bool judge(vector x, vector y, double t) { vector nowx(3); for (int i = 0; i < 3; i++) { nowx[i] = x[i] + t * y[i]; } if (EQ(nowx[0], nowx[1]) || EQ(nowx[1], nowx[2]) || EQ(nowx[0], nowx[2])) { return false; } if ((nowx[1] - nowx[0]) * (nowx[1] - nowx[2]) > 0) { return true; } else { return false; } } int main() { int n, i, j; cin >> n; vi money; i = 1; while (i * (i + 1) / 2 <= n) { money.push_back(i * (i + 1) / 2); i++; } //DEBUG_VEC(money); for (i = 0; i < money.size(); i++) { if (money[i] == n) { cout << 1 << endl; return 0; } } for (i = 0; i < money.size(); i++) { for (j = 0; j < money.size(); j++) { if (money[i] + money[j] == n) { cout << 2 << endl; return 0; } } } cout << 3 << endl; }