#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(ll i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-5;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    ll N;
    cin >> N;
    ll n = N*N;
    ll ans = 0;
    rep2(i, 1, N+1){
        if(n%i != 0) continue;
        ll j = n/i;
        for(ll k = 1; k*k*k <= j; k++){
            if(j%k != 0) continue;
            ll s = i-k, t = j/k;
            if(s*s-4*t < 0) continue;
            ld x = sqrt(s*s-4*t);
            ld y = floor(x);
            if(x-y < EPS){
                ll z = y;
                if(z >= s) continue;
                if((s+z)&1) continue;
                ll b = (s+z)/2, c = (s-z)/2;
                if(c >= k) ans++;
            }
        }
    }
    cout << ans << endl;
}