#include <bits/stdc++.h>
using namespace std;
long long n;
long long d[612345];
long long fd1() {
  if (n % 24 == 0) {
    long long m = n / 24;
    long long p = 1;
    while (p * p * p <= m) {
      if (p * p * p == m) return 1;
      ++p;
    }
  }
  return 0;
}
long long fd2() {
  long long ret = 0;
  if (n % 6 != 0) return 0;
  long long m = n / 6;
  long long lim2 = sqrt(m), lim3 = 1;
  while (lim3 * lim3 * lim3 <= m) lim3++;
  lim3--;
  for (long long i = max((long long)1, lim3 - 10); i <= lim2; ++i) {
    if (m % (i * i) == 0 && m / i / i < i && m / i / i * 2 != i) ret++;
  }
  return ret * 3;
}
long long fd3() {
  long long ret = 0;
  if (n % 3 != 0) return 0;
  long long m = n / 3;
  int p = 0;
  long long q = sqrt(m);
  long long lim3 = 1;
  while (lim3 * lim3 * lim3 <= m) lim3++;
  lim3--;
  for (long long i = 2; i <= q; ++i) {
    if (m % i == 0) {
      d[++p] = i;
      if (i < m / i) d[++p] = m / i;
    }
  }
  sort(d + 1, d + p + 1);
  for (int i = 1; i <= p; ++i) {
    if (d[i] > lim3 + 10) break;
    for (int j = i + 1; j <= p; ++j) {
      if (m / d[i] % d[j] == 0 && m / d[i] / d[j] > d[j]) {
        long long a = d[i] + d[j] - m / d[i] / d[j];
        long long b = d[i] + m / d[i] / d[j] - d[j];
        long long c = d[j] + m / d[i] / d[j] - d[i];
        if (a > 0 && b > 0 && c > 0 && a % 2 == 0 && b % 2 == 0 && c % 2 == 0)
          ret++;
      } else if (m / d[i] / d[j] < d[j])
        break;
    }
  }
  return ret * 6;
}
void op_ar(long long *ar, int num) {
  for (int i = 1; i <= num; ++i) {
    printf("%lld", ar[i]);
    if (i == num)
      printf("\n");
    else
      printf(" ");
  }
}
int main() {
  scanf("%lld", &n);
  long long ans = 0;
  ans += fd1();
  ans += fd2();
  ans += fd3();
  printf("%lld\n", ans);
  return 0;
}
