#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; // const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); } } iosetup; template vector divisor(T val) { vector res; for (T i = 1; i * i <= val; ++i) { if (val % i == 0) { res.emplace_back(i); if (i * i != val) res.emplace_back(val / i); } } sort(ALL(res)); return res; } vector quadratic_equation(double a, double b, double c) { if (abs(a) < EPS) { if (abs(b) < EPS) { assert(abs(c) >= EPS); return {}; } return {-c / b}; } double d = b * b - 4 * a * c; if (abs(d) < EPS) return {-0.5 * b / a}; if (d <= -EPS) return {}; d = sqrt(d); double x1 = -0.5 * (b >= 0 ? b + d : b - d) / a, x2 = c / (x1 * a); if (x1 > x2) swap(x1, x2); return {x1, x2}; } int main() { ll n; cin >> n; vector d = divisor(n * n); int ans = 0; REP(i, d.size()) REP(j, d.size()) { ll x = d[i], y = d[j]; if (n * n % (x * y) == 0) { for (double e : quadratic_equation(1, x + y, -n * n / (x * y))) { ll z = round(e); if (z > 0 && (n * n / (x * y)) % z == 0 && n * n / x / y / z == x + y + z) { ll s = x + y + z; ll a = s - x, b = s - y, c = s - z; ans += 0 < a && a <= b && b <= c; } } } } cout << ans << '\n'; return 0; }