




from __future__ import annotations




def 					lowerCamelCase__       (						A__       :					list  ,			A__       :					int	):





       '''simple docstring'''



       if len(A__	) <= 1 or n <= 1:
              return

       insert_next(A__  ,			n - 1	)
       rec_insertion_sort(A__  ,			n - 1	)




def 					lowerCamelCase__       (						A__       :					list  ,			A__       :					int	):





       '''simple docstring'''



       if index >= len(A__	) or collection[index - 1] <= collection[index]:
              return

       # Swaps adjacent elements since they are not in ascending order
       __lowerCamelCase,   __lowerCamelCase   =						(
           collection[index],
           collection[index - 1],
       )

       insert_next(A__  ,			index + 1	)


if __name__ == "__main__":
       UpperCAmelCase_									=	input('Enter integers separated by spaces: ')
       UpperCAmelCase_									=	[int(num) for num in numbers.split()]
       rec_insertion_sort(number_list, len(number_list))
       print(number_list)



def 							_lowercase							(     )		->		Optional[int]:
					'''simple docstring'''


					SCREAMING_SNAKE_CASE__													= []
					SCREAMING_SNAKE_CASE__													= 1

					while len(UpperCamelCase_		) < 1e6:
										constant.append(str(UpperCamelCase_		)		)
										i += 1

					SCREAMING_SNAKE_CASE__													= ''.join(UpperCamelCase_		)

					return (
					    int(constant[0]		)
					    * int(constant[9]		)
					    * int(constant[99]		)
					    * int(constant[999]		)
					    * int(constant[9999]		)
					    * int(constant[99999]		)
					    * int(constant[999999]		)
					)


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





