mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    N = int(input())
    NN = 16*N*N
    memo = {}
    def divisors(n):
        if n in memo:
            return memo[n]

        ret = []
        for i in range(1, n+1):
            if i*i > n:
                break
            if n % i == 0:
                ret.append(i)
                ret.append(n // i)
        if ret[-1] * ret[-1] == n:
            ret.pop()
        ret.sort(reverse=True)
        memo[n] = ret
        return ret

    ans = 0
    div = divisors(NN)
    for L in div:
        if L**4 < NN:
            break
        ABC = NN // L
        divABC = divisors(ABC)
        for A in divABC:
            if A**3 < ABC:
                break
            if A%2 != L%2:
                continue
            BC = ABC // A
            divBC = divisors(BC)
            for B in divBC:
                if B**2 < BC:
                    break
                C = BC // B
                if B%2 != L%2:
                    continue
                if C%2 != L%2:
                    continue

                # check
                if not A >= B >= C:
                    continue
                a = (L-A) // 2
                b = (L-B) // 2
                c = (L-C) // 2
                if not L == a+b+c:
                    continue
                if a + b <= c:
                    continue
                ans += 1
    print(ans)


if __name__ == '__main__':
    main()