


def 			__lowerCAmelCase       (SCREAMING_SNAKE_CASE   ,   SCREAMING_SNAKE_CASE   ,   SCREAMING_SNAKE_CASE   )->    None:




      """simple docstring"""

      if right <= left:
            return
      snake_case_			= snake_case_			= left
      snake_case_			= right
      snake_case_			= sorting[left]
      while i <= b:
            if sorting[i] < pivot:
                  snake_case_			,       snake_case_			= sorting[i], sorting[a]
                  a += 1
                  i += 1
            elif sorting[i] > pivot:
                  snake_case_			,       snake_case_			= sorting[i], sorting[b]
                  b -= 1
            else:
                  i += 1
      quick_sort_apartition(_UpperCamelCase   ,   _UpperCamelCase   ,   a - 1   )
      quick_sort_apartition(_UpperCamelCase   ,   b + 1   ,   _UpperCamelCase   )






def 			__lowerCAmelCase       (SCREAMING_SNAKE_CASE   ,   SCREAMING_SNAKE_CASE   ,   SCREAMING_SNAKE_CASE   )->    None:




      """simple docstring"""

      if left < right:
            snake_case_			= lomuto_partition(_UpperCamelCase   ,   _UpperCamelCase   ,   _UpperCamelCase   )
            quick_sort_lomuto_partition(_UpperCamelCase   ,   _UpperCamelCase   ,   pivot_index - 1   )
            quick_sort_lomuto_partition(_UpperCamelCase   ,   pivot_index + 1   ,   _UpperCamelCase   )






def 			__lowerCAmelCase       (SCREAMING_SNAKE_CASE   ,   SCREAMING_SNAKE_CASE   ,   SCREAMING_SNAKE_CASE   )->    int:




      """simple docstring"""

      snake_case_			= sorting[right]
      snake_case_			= left
      for i in range(_UpperCamelCase   ,   _UpperCamelCase   ):
            if sorting[i] < pivot:
                  snake_case_			,       snake_case_			= sorting[i], sorting[store_index]
                  store_index += 1
      snake_case_			,       snake_case_			= sorting[store_index], sorting[right]
      return store_index






def 			__lowerCAmelCase       (SCREAMING_SNAKE_CASE   )->    list:




      """simple docstring"""

      if len(_UpperCamelCase   ) <= 1:
            return sorting
      return (
          three_way_radix_quicksort([i for i in sorting if i < sorting[0]]   )
          + [i for i in sorting if i == sorting[0]]
          + three_way_radix_quicksort([i for i in sorting if i > sorting[0]]   )
      )


if __name__ == "__main__":
   import doctest

   doctest.testmod(verbose=True)

   UpperCAmelCase     =       input("""Enter numbers separated by a comma:\n""").strip()
   UpperCAmelCase     =       [int(item) for item in user_input.split(""",""")]
   quick_sort_apartition(unsorted, 0, len(unsorted) - 1)
   print(unsorted)
'''simple docstring'''




__snake_case  : str		       =    10**8





def 	_UpperCAmelCase       (				_UpperCamelCase       :      int  )      -> bool:
    if n % 10 == 0:
        return False
    A_      =  str(_UpperCamelCase  )
    return s == s[::-1]





def 	_UpperCAmelCase       (				)      -> int:
    A_      =  set()
    A_      =  1
    A_      =  5
    while sum_squares < LIMIT:
        A_      =  first_square + 1
        while sum_squares < LIMIT:
            if is_palindrome(_UpperCamelCase  ):
                answer.add(_UpperCamelCase  )
            last_square += 1
            sum_squares += last_square**2
        first_square += 1
        A_      =  first_square**2 + (first_square + 1) ** 2

    return sum(_UpperCamelCase  )


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






