
"""simple docstring"""


def        _lowerCamelCase(__UpperCamelCase			)							->					list:
	_lowerCAmelCase								=len(__UpperCamelCase			)

	# Set the gap value to be decreased by a factor of 1.3
	# after each iteration
	_lowerCAmelCase								=1.3

	# Continue sorting until the gap is 1
	while gap > 1:
		# Decrease the gap value
		_lowerCAmelCase								=int(gap / shrink			)

		# Sort the elements using insertion sort
		for i in range(__UpperCamelCase       ,					len(__UpperCamelCase			)			):
			_lowerCAmelCase								=collection[i]
			_lowerCAmelCase								=i
			while j >= gap and collection[j - gap] > temp:
				_lowerCAmelCase								=collection[j - gap]
				j -= gap
			_lowerCAmelCase								=temp

	return collection


if __name__ == "__main__":
			import doctest

			doctest.testmod()





"""simple docstring"""


def        _lowerCamelCase(__UpperCamelCase = 20			)							->					int:

	try:
		_lowerCAmelCase								=int(__UpperCamelCase			)
	except (TypeError, ValueError):
		raise TypeError("""Parameter n must be int or castable to int."""			)
	if n <= 0:
		raise ValueError("""Parameter n must be greater than or equal to one."""			)
	_lowerCAmelCase								=0
	while 1:
		i += n * (n - 1)
		_lowerCAmelCase								=0
		for j in range(2       ,					__UpperCamelCase			):
			if i % j != 0:
				_lowerCAmelCase								=1
				break
		if nfound == 0:
			if i == 0:
				_lowerCAmelCase								=1
			return i
	return None


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



