






'''simple docstring'''





from __future__ import annotations
def       a__						(  A					):







   if not list_of_ints:
      return []

   if min(_A					) < 0:
      raise ValueError("""All numbers must be positive"""					)

   lowercase__						:	List[Any]         = max(len(bin(_A					)[2:]					) for x in list_of_ints					)
   return _msd_radix_sort(_A		,				_A					)
def       a__						(  A		,				A					):







   if bit_position == 0 or len(_A					) in [0, 1]:
      return list_of_ints

   lowercase__						:	Any         = []
   lowercase__						:	List[Any]         = []
   # Split numbers based on bit at bit_position from the right
   for number in list_of_ints:
      if (number >> (bit_position - 1)) & 1:
         # number has a one at bit bit_position
         ones.append(_A					)
      else:
         # number has a zero at bit bit_position
         zeros.append(_A					)

      # recursively split both lists further
   lowercase__						:	List[Any]         = _msd_radix_sort(_A		,				bit_position - 1					)
   lowercase__						:	int         = _msd_radix_sort(_A		,				bit_position - 1					)

   # recombine lists
   lowercase__						:	Tuple         = zeros
   res.extend(_A					)

   return res
def       a__						(  A					):
   lowercase__						:	List[str]         = len(_A					)
   if not list_of_ints or length == 1:
      return

   if min(_A					) < 0:
      raise ValueError("""All numbers must be positive"""					)

   lowercase__						:	Dict         = max(len(bin(_A					)[2:]					) for x in list_of_ints					)
   _msd_radix_sort_inplace(_A		,				_A		,				0		,				_A					)
def       a__						(  A		,				A		,				A		,				A					):







   if bit_position == 0 or end_index - begin_index <= 1:
      return

   bit_position -= 1

   lowercase__						:	Optional[int]         = begin_index
   lowercase__						:	Union[str, Any]         = end_index - 1
   while i <= j:
      lowercase__						:	List[str]         = False
      if not (list_of_ints[i] >> bit_position) & 1:
         # found zero at the beginning
         i += 1
         lowercase__						:	str         = True
      if (list_of_ints[j] >> bit_position) & 1:
         # found one at the end
         j -= 1
         lowercase__						:	Union[str, Any]         = True

      if changed:
         continue

      lowercase__     ,					lowercase__						:	int         = list_of_ints[j], list_of_ints[i]
      j -= 1
      if j != i:
         i += 1

   _msd_radix_sort_inplace(_A		,				_A		,				_A		,				_A					)
   _msd_radix_sort_inplace(_A		,				_A		,				_A		,				_A					)


if __name__ == "__main__":
 import doctest

 doctest.testmod()










a    =       10**8
def       a__						(  A					):
   if n % 10 == 0:
      return False
   lowercase__						:	Optional[Any]         = str(A					)
   return s == s[::-1]
def       a__						(  ):
   lowercase__						:	Union[str, Any]         = set()
   lowercase__						:	Dict         = 1
   lowercase__						:	List[str]         = 5
   while sum_squares < LIMIT:
      lowercase__						:	Tuple         = first_square + 1
      while sum_squares < LIMIT:
         if is_palindrome(A					):
            answer.add(A					)
         last_square += 1
         sum_squares += last_square**2
      first_square += 1
      lowercase__						:	Any         = first_square**2 + (first_square + 1) ** 2

   return sum(A					)


if __name__ == "__main__":
 print(solution())


