Factors of Factors

You are given an integer N. Define a function f(N) as follows: - If N is prime → f(N) = 0 - Otherwise: - Let d(N) be the number of factors of N - For each factor x of N, recursively compute f(x) - f(N) = d(N) + sum of f(x) for all factors x of N Your task is to compute f(N) for each test case. ### Input The first line contains an integer T, the number of test cases. For each test case: