


from math import exp




def 			__lowercase	(						_UpperCamelCase     )    ->float:







      """simple docstring"""

      return 8 * x - 2 * exp(-x     )




def 			__lowercase	(						_UpperCamelCase,    _UpperCamelCase,    _UpperCamelCase     )    ->float:







      """simple docstring"""

      lowercase			:   int					   =		lower_bound
      lowercase			:   str					   =		upper_bound
      for _ in range(0,    _UpperCamelCase     ):
            lowercase   ,			lowercase			:   Union[str, Any]					   =		xa, xa - (f(_UpperCamelCase     ) * (xa - xa)) / (f(_UpperCamelCase     ) - f(_UpperCamelCase     ))
      return xa


if __name__ == "__main__":
  print(F'''Example: {secant_method(1, 3, 2)}''')





import math




def 			__lowercase	(						_UpperCamelCase     )    ->Union[str, Any]:







      """simple docstring"""

      lowercase			:   List[Any]					   =		0
      if n % 2 == 0:
            count += 1
            while n % 2 == 0:
                  lowercase			:   Any					   =		int(n / 2     )
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

      lowercase			:   Optional[int]					   =		3

      while i <= int(math.sqrt(_UpperCamelCase     )     ):
            if n % i == 0:
                  count += 1
                  while n % i == 0:
                        lowercase			:   Optional[Any]					   =		int(n / i     )
            lowercase			:   str					   =		i + 2

      # this condition checks the prime
      # number n is greater than 2

      if n > 2:
            count += 1
      return count


if __name__ == "__main__":
  __a   				=      51_24_21_83
  print(F'''The number of distinct prime factors is/are {exact_prime_factor_count(n)}''')
  print(F'''The value of log(log(n)) is {math.log(math.log(n)):.4f}''')

