






'''simple docstring'''





import math
def       a__						(  A					):
   lowercase__						:	Dict         = 0
   if n % 2 == 0:
      count += 1
      while n % 2 == 0:
         lowercase__						:	List[Any]         = int(n / 2					)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

   lowercase__						:	int         = 3

   while i <= int(math.sqrt(lowercase__					)					):
      if n % i == 0:
         count += 1
         while n % i == 0:
            lowercase__						:	List[str]         = int(n / i					)
      lowercase__						:	Union[str, Any]         = i + 2

   # this condition checks the prime
   # number n is greater than 2

   if n > 2:
      count += 1
   return count


if __name__ == "__main__":
 a    =       5124_2183
 print(F'The number of distinct prime factors is/are {exact_prime_factor_count(n)}')
 print(F'The value of log(log(n)) is {math.log(math.log(n)):.4f}')










a    =       10**8
def       a__						(  A					):
   if n % 10 == 0:
      return False
   lowercase__						:	Optional[Any]         = str(A					)
   return s == s[::-1]
def       a__						(  ):
   lowercase__						:	Union[str, Any]         = set()
   lowercase__						:	Dict         = 1
   lowercase__						:	List[str]         = 5
   while sum_squares < LIMIT:
      lowercase__						:	Tuple         = first_square + 1
      while sum_squares < LIMIT:
         if is_palindrome(A					):
            answer.add(A					)
         last_square += 1
         sum_squares += last_square**2
      first_square += 1
      lowercase__						:	Any         = first_square**2 + (first_square + 1) ** 2

   return sum(A					)


if __name__ == "__main__":
 print(solution())


