Number of Divisors (Function)#9395
Given an integer , your task is to determine how many divisors it has, excluding 1 and itself.
Implement the following function:
function CountDivisors(n: longint): longint; // Pascal
int CountDivisors(int n); // C++
def CountDivisors(n): // Python
This function should return the number of divisors of .
The function receives a single integer parameter where 2 \leq n < 2^{31}.
The function should return a single integer representing the count of divisors of , excluding 1 and itself.
Example 1