






_UpperCAmelCase					:						List[Any]         =     10**8






def  UpperCAmelCase__						(    lowerCamelCase	:			int    ):
   if n % 10 == 0:
      return False
   lowerCamelCase									=str(lowerCamelCase    )
   return s == s[::-1]






def  UpperCAmelCase__						(    ):
   lowerCamelCase									=set()
   lowerCamelCase									=1
   lowerCamelCase									=5
   while sum_squares < LIMIT:
      lowerCamelCase									=first_square + 1
      while sum_squares < LIMIT:
         if is_palindrome(lowerCamelCase    ):
            answer.add(lowerCamelCase    )
         last_square += 1
         sum_squares += last_square**2
      first_square += 1
      lowerCamelCase									=first_square**2 + (first_square + 1) ** 2

   return sum(lowerCamelCase    )


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







def  UpperCAmelCase__						(    lowerCamelCase	:			list    ):
   lowerCamelCase									=1.3
   lowerCamelCase									=len(lowerCamelCase    )
   lowerCamelCase									=False

   while not completed:
      # Update the gap value for a next comb
      lowerCamelCase									=int(gap / shrink_factor    )
      if gap <= 1:
         lowerCamelCase									=True

      lowerCamelCase									=0
      while index + gap < len(lowerCamelCase    ):
         if data[index] > data[index + gap]:
            # Swap values
            lowerCamelCase				,       lowerCamelCase									=data[index + gap], data[index]
            lowerCamelCase									=False
         index += 1

   return data


if __name__ == "__main__":
   import doctest

   doctest.testmod()

   _UpperCAmelCase					:						List[Any]         =     input('Enter numbers separated by a comma:\n').strip()
   _UpperCAmelCase					:						Optional[Any]         =     [int(item) for item in user_input.split(',')]
   print(comb_sort(unsorted))