#include <bits/stdc++.h>
using namespace std;
long long num[200000];
long long n;
long long i, j, s, t1, t2, t3, t4, t5, t6, t7, sum_num;
int main() {
  scanf("%I64d", &n);
  if (n % 3) {
    printf("0");
    return 0;
  }
  n = n / 3;
  for (i = 2; i * i <= n; i++)
    if (n % i == 0) sum_num++, num[sum_num] = i;
  for (i = 1; i <= sum_num; i++)
    for (j = i; (num[i] * num[j] * num[j] <= n) && (j <= sum_num); j++)
      if ((n % (num[i] * num[j]) == 0) && (n % (n / num[i] / num[j]) == 0)) {
        t1 = num[i], t2 = num[j], t3 = n / num[i] / num[j];
        if ((t1 + t2 + t3) & 1) continue;
        t7 = (t1 + t2 + t3) / 2;
        t4 = t7 - t2, t5 = t7 - t3, t6 = t7 - t1;
        if ((t4 > 0) && (t5 > 0) && (t6 > 0))
          if ((t4 == t5) && (t5 == t6))
            s = s + 1;
          else if ((t4 == t5) || (t5 == t6) || (t4 == t6))
            s = s + 3;
          else
            s = s + 6;
      }
  printf("%I64d", s);
  return 0;
}
