In this problem we are asked how many ways we can pick a non-zero number of leaders such that the remaining employees, after leaders are taken from the total, can each have an equal number of employees assigned to them. The input bounds are small, $2 \leq n \leq 10^5$, so brute force is possible. Just take $i$ from $1$ to half of $n$ and each time ask, does $i$ go into $(n - i)$ evenly? If so, increment our counter and continue.