


def 				lowerCamelCase__	(      a	:   list	,  a	:   int = 0				)    ->	list:





			"""simple docstring"""
			a__ :List[str]						  =    length or len(a				)
			a__ :Union[str, Any]						  =    False
			for i in range(length - 1				):
						if list_data[i] > list_data[i + 1]:
									a__  ,  a__ :int						  =    list_data[i + 1], list_data[i]
									a__ :str						  =    True

			return list_data if not swapped else bubble_sort(a	,  length - 1				)


if __name__ == "__main__":
		import doctest

		doctest.testmod()






def 				lowerCamelCase__	(      a	:   int = 100				)    ->	int:





			"""simple docstring"""
			a__ :Tuple						  =    n * (n + 1) * (2 * n + 1) / 6
			a__ :Tuple						  =    (n * (n + 1) / 2) ** 2
			return int(square_of_sum - sum_of_squares				)


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


