
def    _a (						lowerCamelCase							):

 for insert_index, insert_value in enumerate(collection[1:]							):
  lowerCamelCase		:     Any          =				insert_index
  while insert_index >= 0 and insert_value < collection[insert_index]:
   lowerCamelCase		:     str          =				collection[insert_index]
   insert_index -= 1
  if insert_index != temp_index:
   lowerCamelCase		:     Optional[int]          =				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) = }''')






def    _a (						lowerCamelCase,     lowerCamelCase,     lowerCamelCase							):
 lowerCamelCase		:     Optional[int]          =				[1 / first_term]
 lowerCamelCase		:     Any          =				1 / first_term
 for _ in range(number_of_terms - 1							):
  first_term += common_difference
  arithmetic_progression.append(lowerCamelCase							)
 lowerCamelCase		:     Optional[Any]          =				[1 / step for step in arithmetic_progression]
 return sum(lowerCamelCase							)


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      print(sum_of_harmonic_progression(1 / 2, 2, 2))




