



from __future__ import annotations

UpperCamelCase__ =						10






def  UpperCAmelCase__    (    lowercase__   ) ->      int:
						__lowercase					=				1
						__lowercase					=				max(lowerCamelCase_   )
						while placement <= max_digit:
												# declare and initialize empty buckets
												__lowercase					=				[[] for _ in range(lowerCamelCase_   )]
												# split list_of_ints between the buckets
												for i in list_of_ints:
																		__lowercase					=				int((i / placement) % RADIX   )
																		buckets[tmp].append(lowerCamelCase_   )
												# put each buckets' contents into list_of_ints
												__lowercase					=				0
												for b in range(lowerCamelCase_   ):
																		for i in buckets[b]:
																								__lowercase					=				i
																								a += 1
        # move to next
												placement *= RADIX
						return list_of_ints


if __name__ == "__main__":
			import doctest

			doctest.testmod()










def  UpperCAmelCase__    (    lowercase__ = 100   ) ->      int:
						__lowercase					=				n * (n + 1) * (2 * n + 1) / 6
						__lowercase					=				(n * (n + 1) / 2) ** 2
						return int(square_of_sum - sum_of_squares   )


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





