

def 			_UpperCAmelCase							(		a__):

			'''simple docstring'''



			a_		:		int				    =				len(a__)

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

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

						# Sort the elements using insertion sort
						for i in range(a__       ,					len(a__)):
									a_		:		List[Any]				    =				collection[i]
									a_		:		Union[str, Any]				    =				i
									while j >= gap and collection[j - gap] > temp:
												a_		:		Any				    =				collection[j - gap]
												j -= gap
									a_		:		Any				    =				temp

			return collection


if __name__ == "__main__":
	import doctest

	doctest.testmod()





def 			_UpperCAmelCase							(		a__):

			'''simple docstring'''



			return 1 if input_a == 0 else 0


def 			_UpperCAmelCase							(		):

			'''simple docstring'''



			assert not_gate(0) == 1
			assert not_gate(1) == 0


if __name__ == "__main__":
	print(not_gate(0))
	print(not_gate(1))


