#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << #x << ':' << x << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }

ll square(ll n) {
	ll d = sqrt(n);
	for (ll i = max(d - 5, 0ll); i <= d + 5; i++) {
		if (i * i == n) return i;
	}
	return -1;
}

typedef pair<ll, P> T;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);

	ll n;
	cin >> n;
	ll m = n * n;
	vector<ll> vec;
	for (ll i = 1; i <= n; i++) {
		if (m % i == 0) vec.pb(i);
	}
	ll ans = 0;
	for (ll i = 1; i <= n; i++) {
		if (m % i) continue;
		set<T> st;
		ll pro = m / i;
		for (ll x : vec) {
			if (x >= i) break;
			if (pro % x) continue;
			ll b = i - x;
			ll c = pro / x;
			ll d = b * b - 4 * c;
			ll sd = square(d);
			if (sd == -1 || ((b + sd) & 1)) continue;
			ll y = (b + sd) / 2; ll z = (b - sd) / 2;
			ll mi = min({ x,y,z });
			ll ma = max({ x,y,z });
			st.insert(T(mi, P(x + y + z - mi - ma, ma)));
		}
		ans += st.size();
	}
	cout << ans << '\n';
}