#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll INF=1e18;
const ll mod=1e9+7;
const double eps=0.000000001;

int main(){
    ll n;
    cin >> n;
    vector<ll> divs;
    for(ll i=1;i<=n;i++){
        if(n*n%i==0){
            divs.push_back(i);
        }
    }
    ll ans=0;
    for(ll i=0;i<divs.size();i++){
        ll x=divs[i];
        for(ll j=i;j<divs.size();j++){
            ll y=divs[j];
            if(x*y*(x+y)>n*n) break;
            for(ll k=j;k<divs.size();k++){
                ll z=divs[k];
                if(x*y*z*(x+y+z)>n*n) break;
                if(x*y*z*(x+y+z)==n*n) ans++;
            }
        }
    }
    cout << ans << endl;
    return 0;
}