Number of Divisors (Function)

Given an integer ( n ), your task is to determine how many divisors it has, excluding 1 and ( n ) itself.

Implement the following function:

Pascal:

function CountDivisors(n: longint): longint;

C++:

int CountDivisors(int n);

Python:

def CountDivisors(n):

This function should return the number of divisors of ( n ).

Input

The function receives a single integer parameter n where ( 2 \leq n < 2^{31} ).

Output

The function should return a single integer representing the count of divisors of ( n ), excluding 1 and ( n ) itself.

Examples