'''simple docstring'''
from transformers import SqueezeBertTokenizer, SqueezeBertTokenizerFast
from transformers.testing_utils import require_tokenizers, slow

from ..bert.test_tokenization_bert import BertTokenizationTest




@require_tokenizers
class _lowerCAmelCase			(	snake_case					):
      UpperCAmelCase_	:						Dict	 =       SqueezeBertTokenizer
      UpperCAmelCase_	:						Any	 =       SqueezeBertTokenizerFast
      UpperCAmelCase_	:						Union[str, Any]	 =       True







      def      lowerCamelCase__      (  self  ,    **lowercase     ):
        return SqueezeBertTokenizerFast.from_pretrained(self.tmpdirname  ,    **lowercase     )







      @slow
      def      lowerCamelCase__      (  self     ):
        lowercase				:							Optional[Any]									=   SqueezeBertTokenizer.from_pretrained('''squeezebert/squeezebert-mnli-headless'''     )

        lowercase				:							Tuple									=   tokenizer.encode('''sequence builders'''  ,    add_special_tokens=lowercase     )
        lowercase				:							Tuple									=   tokenizer.encode('''multi-sequence build'''  ,    add_special_tokens=lowercase     )

        lowercase				:							Tuple									=   tokenizer.build_inputs_with_special_tokens(lowercase     )
        lowercase				:							Union[str, Any]									=   tokenizer.build_inputs_with_special_tokens(lowercase  ,    lowercase     )

        assert encoded_sentence == [tokenizer.cls_token_id] + text + [tokenizer.sep_token_id]
        assert encoded_pair == [tokenizer.cls_token_id] + text + [tokenizer.sep_token_id] + text_a + [
            tokenizer.sep_token_id
        ]
'''simple docstring'''
import math







def 				__UpperCamelCase (					__UpperCAmelCase  :					str			)							->	Optional[int]:
  lowercase				:							Tuple									=   0
  if n % 2 == 0:
    count += 1
    while n % 2 == 0:
      lowercase				:							Optional[int]									=   int(n / 2			)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

  lowercase				:							Dict									=   3

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

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

  if n > 2:
    count += 1
  return count


if __name__ == "__main__":
 _A		:      List[Any]						   =5_1_2_4_2_1_8_3
 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}""")