






def   SCREAMING_SNAKE_CASE__						(   snake_case_  )   ->  list:


	"""simple docstring"""



	a		=			len(snake_case_  )

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

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

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

	return collection


if __name__ == "__main__":
				import doctest

				doctest.testmod()













def   SCREAMING_SNAKE_CASE__						(   snake_case_  )   ->  int:


	"""simple docstring"""



	return n * (2 * n - 1)





def   SCREAMING_SNAKE_CASE__						(   snake_case_  )   ->  bool:


	"""simple docstring"""



	a		=			(1 + 2_4 * n) ** 0.5
	return ((1 + root) / 6) % 1 == 0





def   SCREAMING_SNAKE_CASE__						(   snake_case_ = 1_4_4  )   ->  int:


	"""simple docstring"""



	a		=			start
	a		=			hexagonal_num(snake_case_  )
	while not is_pentagonal(snake_case_  ):
		n += 1
		a		=			hexagonal_num(snake_case_  )
	return num


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





