#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

ll n;
vector<ll> di;
vector<ll> di2;

int main(void){
	scanf("%lld",&n);
	for(ll i=1;i*i<=n;i++){
		if(n%i==0){
			di.push_back(i);
			if(n!=i*i){
				di.push_back(n/i);
			}
		}
	}
	sort(di.begin(),di.end());
	for(int i=0;i<di.size();i++){
		for(int j=0;j<di.size();j++){
			di2.push_back(di[i]*di[j]);
		}
	}
	sort(di2.begin(),di2.end());
	di2.erase(unique(di2.begin(),di2.end()),di2.end());
	int ans=0;
	for(int i=0;i<di2.size();i++){
		if(di2[i]>=n)continue;
		for(int j=0;j<=i;j++){
			//printf("%d %d\n",i,j);
			ll l=0,r=j+1;
			ll x=di2[i],y=di2[j];
			while(l+1LL<r){
				ll mid=di2[(l+r)/2];
				//printf("%lld\n",mid);
				ll val=x*y*mid;
				if(val>n*n){
					r=(l+r)/2;
					continue;
				}
				val=val*(x+y+mid);
				if(val<=n*n){
					l=(l+r)/2;
				}else{
					r=(l+r)/2;
				}
			}
			l=di2[l];
			ll val=x*y*l*(x+y+l);
			if(val==n*n){
				ans++;
			}
		}
	}
	printf("%d\n",ans);
	return 0;
}