


'''simple docstring'''



import numpy as np




def       _a      (		_lowercase   :      Union[str, Any]    ):





     '''simple docstring'''






     __UpperCAmelCase      :					Optional[int]    				=     np.exp(_UpperCamelCase    )

     # Add up the all the exponentials
     __UpperCAmelCase      :					Any    				=     np.sum(_UpperCamelCase    )

     # Divide every exponent by the sum of all exponents
     __UpperCAmelCase      :					Optional[Any]    				=     exponent_vector / sum_of_exponents

     return softmax_vector


if __name__ == "__main__":
      print(softmax((0,)))
'''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())






