'''simple docstring'''





def     __lowerCAmelCase						(       a_		)      ->	Dict:





     '''simple docstring'''





     return 10 - x * x


def     __lowerCAmelCase						(       a_       ,      a_		)      ->	Optional[int]:





     '''simple docstring'''





     if equation(SCREAMING_SNAKE_CASE_		) * equation(SCREAMING_SNAKE_CASE_		) >= 0:
          raise ValueError('Wrong space!'		)

     SCREAMING_SNAKE_CASE					:			List[Any]    	=       a
     while (b - a) >= 0.01:
          # Find middle point
          SCREAMING_SNAKE_CASE					:			Any    	=       (a + b) / 2
          # Check if middle point is root
          if equation(SCREAMING_SNAKE_CASE_		) == 0.0:
               break
          # Decide the side to repeat the steps
          if equation(SCREAMING_SNAKE_CASE_		) * equation(SCREAMING_SNAKE_CASE_		) < 0:
               SCREAMING_SNAKE_CASE					:			List[str]    	=       c
          else:
               SCREAMING_SNAKE_CASE					:			Union[str, Any]    	=       c
     return c


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 print(bisection(-2, 5))
 print(bisection(0, 6))

'''simple docstring'''





def     __lowerCAmelCase						(       a_ = 1000		)      ->	int:





     '''simple docstring'''





     SCREAMING_SNAKE_CASE					:			Union[str, Any]    	=       2**power
     SCREAMING_SNAKE_CASE					:			Any    	=       str(a_		)
     SCREAMING_SNAKE_CASE					:			int    	=       list(a_		)
     SCREAMING_SNAKE_CASE					:			Any    	=       0

     for i in list_num:
          sum_of_num += int(a_		)

     return sum_of_num


if __name__ == "__main__":
 _lowerCAmelCase  :Tuple  				=    int(input("""Enter the power of 2: """).strip())
 print("""2 ^ """, power, """ = """, 2**power)
 _lowerCAmelCase  :int  				=    solution(power)
 print("""Sum of the digits is: """, result)



