

'''simple docstring'''
def       a__    (  _SCREAMING_SNAKE_CASE					:    list							)			-> list:


	"""simple docstring"""





	UpperCAmelCase_			:	str      =   len(_SCREAMING_SNAKE_CASE							)

	# Set the gap value to be decreased by a factor of 1.3
	# after each iteration
	UpperCAmelCase_			:	Union[str, Any]      =   1.3

	# Continue sorting until the gap is 1
	while gap > 1:
		# Decrease the gap value
		UpperCAmelCase_			:	List[Any]      =   int(gap / shrink							)

		# Sort the elements using insertion sort
		for i in range(_SCREAMING_SNAKE_CASE     ,							len(_SCREAMING_SNAKE_CASE							)							):
			UpperCAmelCase_			:	Any      =   collection[i]
			UpperCAmelCase_			:	int      =   i
			while j >= gap and collection[j - gap] > temp:
				UpperCAmelCase_			:	Optional[Any]      =   collection[j - gap]
				j -= gap
			UpperCAmelCase_			:	Optional[int]      =   temp

	return collection


if __name__ == "__main__":
					import doctest

					doctest.testmod()









"""simple docstring"""







from itertools import combinations_with_replacement


def       __SCREAMING_SNAKE_CASE      (   __UpperCAmelCase = 100	):
		_lowercase							:      list[int]			=					[*list(range(1					,							21	)	), 25]
		_lowercase							:      list[int]			=					[2 * x for x in range(1					,							21	)] + [50]
		_lowercase							:      list[int]			=					[3 * x for x in range(1					,							21	)]
		_lowercase							:      list[int]			=					singles + doubles + triples + [0]

		_lowercase							:      int			=					0
		_lowercase							:      int
		_lowercase							:      int
		_lowercase							:      int
		_lowercase							:      int

		for double in doubles:
				for throwa, throwa in combinations_with_replacement(__UpperCAmelCase					,							2	):
						_lowercase							:      Union[str, Any]			=					double + throwa + throwa
						if checkout_total < limit:
								num_checkouts += 1

		return num_checkouts


if __name__ == "__main__":
		print(F'{solution() = }')



