


'''simple docstring'''





import unittest

from transformers import is_torch_available, load_tool

from .test_tools_common import ToolTesterMixin


if is_torch_available():
  import torch







class 				__SCREAMING_SNAKE_CASE   (			unittest.TestCase  ,						A__   ):


      def        __lowerCamelCase			(							self		):
            lowercase			:   Union[str, Any]					   =		load_tool('''speech-to-text'''		)
            self.tool.setup()


      def        __lowerCamelCase			(							self		):
            lowercase			:   Union[str, Any]					   =		self.tool(torch.ones(3000		)		)
            self.assertEqual(SCREAMING_SNAKE_CASE__							,						''' you'''		)






      def        __lowerCamelCase			(							self		):
            lowercase			:   Tuple					   =		self.tool(audio=torch.ones(3000		)		)
            self.assertEqual(SCREAMING_SNAKE_CASE__							,						''' you'''		)





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

