#include<iostream>
#include<vector>
#include<cmath>

using namespace std;

typedef long long ll;

bool is_square(ll x, ll& y) {
	ll ok = 2000000, ng = 0;
	while (ok - ng > 1) {
		ll mid = (ok + ng) / 2;
		if (mid * mid >= x) ok = mid;
		else ng = mid;
	}
	y = ok;
	return ok * ok == x;
}

ll solve(ll a, ll b, ll c) {
	if (4 * a * c > b * b)
		return 1145141919810893;
	ll ret;
	if (!is_square(b * b - 4 * a * c, ret))
		return 1145141919810893;
	ll bunshi = -b + ret;
	if (bunshi < 0)
		return 1145141919810893;
	if (bunshi % (2 * a) != 0)
		return 1145141919810893;
	return bunshi / (2 * a);
}

int main() {
	ll N;
	cin >> N;
	vector<ll> yakusu;
	for (ll i = 1; i <= N; i++) {
		if ((N * N) % i == 0)yakusu.push_back(i);
	}
	ll ans = 0;
	for (int i = 0; i < yakusu.size(); i++) {
		for(int j = 0; j <= i; j++){
			ll x = yakusu[i], y = yakusu[j];
			//N^2=x*y*z*(x+y+z)となる(x, y, z)を求める。
			//ここでは、zの解があるか、そしてx >= y >= zなのかをたしかめる。
			//overflow防止のために、x*yで両辺を割る。
			if ((N * N) % (x * y) != 0)continue;
			if (solve(1, x + y, -N * N / (x * y)) <= y) {
				ans++;
			}
		}
	}
	cout << ans << endl;
	return 0;
}