



def 						_UpperCAmelCase							( snake_case     ):





					"""simple docstring"""

					_lowerCAmelCase         =       len(snake_case     )

					# 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(snake_case      ,		len(snake_case     )     ):
															_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"""







from itertools import combinations, product





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_):
					if xa == ya == 0 or xa == ya == 0:
										return False
					a__ 							=	xa * xa + ya * ya
					a__ 							=	xa * xa + ya * ya
					a__ 							=	(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
					return (
					    a_square + b_square == c_square
					    or a_square + c_square == b_square
					    or b_square + c_square == a_square
					)





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_ = 50):
					return sum(
					    1
					    for pta, pta in combinations(product(range(limit + 1)			,  repeat=2)			,  2)
					    if is_right(*lowerCamelCase_			,  *lowerCamelCase_))


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


