

'''simple docstring'''







from transformers import DistilBertTokenizer, DistilBertTokenizerFast
from transformers.testing_utils import require_tokenizers, slow

from ..bert.test_tokenization_bert import BertTokenizationTest


@require_tokenizers
class 					A__      (      _snake_case			):
    lowercase						=		DistilBertTokenizer
    lowercase						=		DistilBertTokenizerFast
    lowercase						=		True



    @slow
    def 					snake_case_			(					self       )						->      Tuple:





           '''simple docstring'''
           A_						=      DistilBertTokenizer.from_pretrained("""distilbert-base-uncased"""       )

           A_						=      tokenizer.encode("""sequence builders"""		,				add_special_tokens=__A       )
           A_						=      tokenizer.encode("""multi-sequence build"""		,				add_special_tokens=__A       )

           A_						=      tokenizer.build_inputs_with_special_tokens(__A       )
           A_						=      tokenizer.build_inputs_with_special_tokens(__A		,				__A       )

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







from __future__ import annotations

import math
def       UpperCAmelCase__    (      UpperCAmelCase__				)			->			bool:

       if 1 < number < 4:
              # 2 and 3 are primes
              return True
       elif number < 2 or number % 2 == 0 or number % 3 == 0:
              # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
              return False

       # All primes number are in format of 6k +/- 1
       for i in range(5,       int(math.sqrt(UpperCAmelCase__				) + 1				),       6				):
              if number % i == 0 or number % (i + 2) == 0:
                     return False
       return True


__lowerCamelCase		       =    [num for num in range(3, 10_0001, 2) if not is_prime(num)]
def       UpperCAmelCase__    (      UpperCAmelCase__				)			->			list[int]:
       if not isinstance(UpperCAmelCase__,       UpperCAmelCase__				):
              raise ValueError("""n must be an integer"""				)
       if n <= 0:
              raise ValueError("""n must be >= 0"""				)

       A_						=      []
       for num in range(len(UpperCAmelCase__				)				):
              A_						=      0
              while 2 * i * i <= odd_composites[num]:
                     A_						=      odd_composites[num] - 2 * i * i
                     if is_prime(UpperCAmelCase__				):
                            break
                     i += 1
              else:
                     list_nums.append(odd_composites[num]				)
                     if len(UpperCAmelCase__				) == n:
                            return list_nums

       return []
def       UpperCAmelCase__    (      )			->			int:
       return compute_nums(1				)[0]


if __name__ == "__main__":
      print(f"""{solution() = }""")
