SP17714 SPCM - Gopu and function

Once Gopu was reading a maths problem which had a weird looking function f as follows. { 1, if n is a prime number. **f(n) =** f (sum of prime divisors of n) + number of distinct prime divisors of n, otherwise. } Compute f (n) for a given value of n.

First line contains T : number of test cases. (1

For each test case, output value of f (n) in a single line.