





def 							lowerCAmelCase_				(    A_):

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


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

   testmod()

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








def 							lowerCAmelCase_				(    A_  ,A_  ,A_):
    UpperCamelCase__:					Optional[int]												=      [1 / first_term]
    UpperCamelCase__:					int												=      1 / first_term
    for _ in range(number_of_terms - 1):
        first_term += common_difference
        arithmetic_progression.append(A_)
    UpperCamelCase__:					str												=      [1 / step for step in arithmetic_progression]
    return sum(A_)


if __name__ == "__main__":
   import doctest

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

