#include
using namespace std;
int count_of_divisors(int n)
{
int res = 0;
for (int i = 2; i * i <= n; ++i)<br> if (n % i == 0)
res += 2 - (i *i == n);
return res + 2 - (n == 1);
}
int main()
{
int n;
cin >> n;
cout << count_of_divisors(n) << endl;<br>}
//Ассимптотика O(log(n));