def __prime_divisors(n):
    """
    Calculates all prime divisors of n naively.
    """
    candidate = 2
    primes = []

    while candidate <= n:
        if n % candidate == 0:
            primes.append(candidate)

            while n % candidate == 0:
                n /= candidate

        candidate += 1

    return primes