'''simple docstring'''




def 	_UpperCAmelCase       (				_UpperCamelCase       :      List[Any]  )      -> str:
    A_      =  len(_UpperCamelCase  )
    for _ in range(
        0,  int(((no_of_elements - 1) / 2) + 1  )  ):  # we don't need to traverse to end of list as
        for j in range(0,  no_of_elements - 1  ):
            if (
                lst[j + 1] < lst[j]
            ):  # applying bubble sort algorithm from left to right (or forwards)
                A_      =  lst[j + 1]
                A_      =  lst[j]
                A_      =  temp
            if (
                lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
            ):  # applying bubble sort algorithm from right to left (or backwards)
                A_      =  lst[no_of_elements - 1 - j]
                A_      =  lst[no_of_elements - 2 - j]
                A_      =  temp
    return lst


if __name__ == "__main__":
  print('enter the list to be sorted')
  __snake_case  : Optional[int]		       =    [int(x) for x in input().split()]  # inputing elements of the list in one line
  __snake_case  : List[str]		       =    double_sort(lst)
  print('the sorted list is')
  print(sorted_lst)







'''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())






