


lowerCAmelCase           =		[
    (1_0_0_0, '''M'''),
    (9_0_0, '''CM'''),
    (5_0_0, '''D'''),
    (4_0_0, '''CD'''),
    (1_0_0, '''C'''),
    (9_0, '''XC'''),
    (5_0, '''L'''),
    (4_0, '''XL'''),
    (1_0, '''X'''),
    (9, '''IX'''),
    (5, '''V'''),
    (4, '''IV'''),
    (1, '''I'''),
]







def        _lowerCamelCase(	lowercase__	)						->	int:

		'''simple docstring'''







		__lowercase=			{'I': 1, 'V': 5, 'X': 1_0, 'L': 5_0, 'C': 1_0_0, 'D': 5_0_0, 'M': 1_0_0_0}
		__lowercase=			0
		__lowercase=			0
		while place < len(lowercase__	):
				if (place + 1 < len(lowercase__	)) and (vals[roman[place]] < vals[roman[place + 1]]):
						total += vals[roman[place + 1]] - vals[roman[place]]
						place += 2
				else:
						total += vals[roman[place]]
						place += 1
		return total







def        _lowerCamelCase(	lowercase__	)						->	str:

		'''simple docstring'''







		__lowercase=			[]
		for arabic, roman in ROMAN:
				((__lowercase),							(__lowercase))=			divmod(lowercase__   , lowercase__	)
				result.append(roman * factor	)
				if number == 0:
						break
		return "".join(lowercase__	)


if __name__ == "__main__":
	import doctest

	doctest.testmod()










from __future__ import annotations







def        _lowerCamelCase(	lowercase__   , lowercase__	)						->	Any:

		'''simple docstring'''







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

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







def        _lowerCamelCase(	lowercase__   , lowercase__	)						->	Any:

		'''simple docstring'''







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

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

		insert_next(lowercase__   , index + 1	)


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






