#include <iostream>

int prime_divisors(int num)
{
    int count = 0;

    for (int i = 2; i*i < num; i++)
    {
        if (num % i == 0)
        {
            bool isprime = true;

            for (int j = 2; j*j < i; j++)
                if (i % j == 0)
                    isprime = false;

            if (isprime)
                count++;
        }
    }

    return count;
}

int main() {
  std::cout << prime_divisors(2*5*7);
}