#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long LL; typedef double D; #define all(v) (v).begin(), (v).end() mt19937 gene(233); typedef complex Complex; #define fi first #define se second #define ins insert #define pb push_back inline char GET_CHAR(){ const int maxn = 131072; static char buf[maxn],*p1=buf,*p2=buf; return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++; } inline int getInt() { int res(0); char c = getchar(); while(c < '0') c = getchar(); while(c >= '0') { res = res * 10 + (c - '0'); c = getchar(); } return res; } inline LL fastpo(LL x, LL n, LL mod) { LL res(1); while(n) { if(n & 1) { res = res * (LL)x % mod; } x = x * (LL) x % mod; n /= 2; } return res; } LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; } inline string itoa(int x, int width = 0) { string res; if(x == 0) res.push_back('0'); while(x) { res.push_back('0' + x % 10); x /= 10; } while((int)res.size() < width) res.push_back('0'); reverse(res.begin(), res.end()); return res; } const int _B = 131072; char buf[_B]; int _bl = 0; inline void flush() { fwrite(buf, 1, _bl, stdout); _bl = 0; } __inline void _putchar(char c) { if(_bl == _B) flush(); buf[_bl++] = c; } inline void print(LL x, char c) { static char tmp[20]; int l = 0; if(!x) tmp[l++] = '0'; else { while(x) { tmp[l++] = x % 10 + '0'; x /= 10; } } for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]); _putchar(c); } struct P { D x, y; }; const int N = 300033; const int LOG = 20; const int mod = 1e9 + 7; const int inf = 1e9 + 7; int n, m; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; int main() { LL n; vector v, u; cin >> n; for(int p = 1; p <= n; p++) { if(n % p == 0) v.push_back(p); } for(int i = 0; i < (int)v.size(); i++) { for(int j = 0; j <= i; j++) { u.push_back(v[i] * v[j]); } } sort(u.begin(), u.end()); u.resize(unique(u.begin(), u.end()) - u.begin()); int ans = 0; //cout << u.size() << endl; vector> w(u.size()); for(int i = 0; i < (int)u.size(); i++) { for(int j = 0; j <= i; j++) { if(u[i] % u[j] == 0) { w[i].pb(u[j]); } } } for(int id = 0; id < (int)u.size(); id++) { LL p = u[id]; LL nnp = lower_bound(u.begin(), u.end(), n * n / p) - u.begin(); for(LL pa : w[nnp]) { if(pa >= p) break; LL a = p - pa; //cout << p << ' ' << a << endl; LL nb = lower_bound(u.begin(), u.end(), n * n / p / (p - a)) - u.begin(); for(LL pb : w[nb]) { LL b = p - pb; if(b < max(a, p - a + 1) || b >= p) continue; //cout << p << ' ' << a << ' ' << b << endl; LL c = p * 2 - a - b; if(c < a || c < b) continue; if(n * n / p / (p - a) / (p - b) != p - c) continue; ans++; } } } cout << ans << endl; }