




'''simple docstring'''



def 				SCREAMING_SNAKE_CASE_				(							__A       :				list						)				->				list:

     for insert_index, insert_value in enumerate(collection[1:]						):
          _SCREAMING_SNAKE_CASE =   insert_index
          while insert_index >= 0 and insert_value < collection[insert_index]:
               _SCREAMING_SNAKE_CASE =   collection[insert_index]
               insert_index -= 1
          if insert_index != temp_index:
               _SCREAMING_SNAKE_CASE =   insert_value
     return collection


if __name__ == "__main__":
 from doctest import testmod

 testmod()

 lowerCamelCase_	 =		input('Enter numbers separated by a comma:\n').strip()
 lowerCamelCase_	 =		[int(item) for item in user_input.split(',')]
 print(f'''{insertion_sort(unsorted) = }''')







'''simple docstring'''



import math
def 				SCREAMING_SNAKE_CASE_				(							__A       :				Tuple						)				->				List[Any]:
   _SCREAMING_SNAKE_CASE =   0
   if n % 2 == 0:
      count += 1
      while n % 2 == 0:
         _SCREAMING_SNAKE_CASE =   int(n / 2						)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

   _SCREAMING_SNAKE_CASE =   3

   while i <= int(math.sqrt(__A						)						):
      if n % i == 0:
         count += 1
         while n % i == 0:
            _SCREAMING_SNAKE_CASE =   int(n / i						)
      _SCREAMING_SNAKE_CASE =   i + 2

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

   if n > 2:
      count += 1
   return count


if __name__ == "__main__":
 lowerCamelCase_	 =		51_24_21_83
 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}''')

