#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<complex>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define INF (1<<29)
#define LINF (1LL<<60)
#define EPS (1e-10)
#define PI 3.1415926535897932384626433832795028
typedef long long Int;
typedef pair<Int, Int> P;
typedef long double Real;
typedef complex<Real> CP;

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