





"""simple docstring"""
def 						_SCREAMING_SNAKE_CASE       (_UpperCAmelCase :  list       ):
 lowerCAmelCase  							=      len(_UpperCAmelCase       )
 for cycle_start in range(0   ,			array_len - 1       ):
  lowerCAmelCase  							=      array[cycle_start]

  lowerCAmelCase  							=      cycle_start
  for i in range(cycle_start + 1   ,			_UpperCAmelCase       ):
   if array[i] < item:
    pos += 1

  if pos == cycle_start:
   continue

  while item == array[pos]:
   pos += 1

  lowerCAmelCase							,lowerCAmelCase  							=      item, array[pos]
  while pos != cycle_start:
   lowerCAmelCase  							=      cycle_start
   for i in range(cycle_start + 1   ,			_UpperCAmelCase       ):
    if array[i] < item:
     pos += 1

   while item == array[pos]:
    pos += 1

   lowerCAmelCase							,lowerCAmelCase  							=      item, array[pos]

 return array


if __name__ == "__main__":
       assert cycle_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
       assert cycle_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]












"""simple docstring"""
__UpperCamelCase			:		Tuple		    =   10**8

def 						_SCREAMING_SNAKE_CASE       (_UpperCAmelCase :  int       ):
 if n % 10 == 0:
  return False
 lowerCAmelCase  							=      str(_UpperCAmelCase       )
 return s == s[::-1]

def 						_SCREAMING_SNAKE_CASE       ():
 lowerCAmelCase  							=      set()
 lowerCAmelCase  							=      1
 lowerCAmelCase  							=      5
 while sum_squares < LIMIT:
  lowerCAmelCase  							=      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
  lowerCAmelCase  							=      first_square**2 + (first_square + 1) ** 2

 return sum(_UpperCAmelCase       )


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





