



'''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  SCREAMING_SNAKE_CASE (  _a		):






    """simple docstring"""





    _SCREAMING_SNAKE_CASE	  =  DistilBertTokenizer
    _SCREAMING_SNAKE_CASE	  =  DistilBertTokenizerFast
    _SCREAMING_SNAKE_CASE	  =  True






    @slow
    def  A       (  self      :					List[str] ):


       """simple docstring"""







       UpperCamelCase					=  DistilBertTokenizer.from_pretrained('distilbert-base-uncased' )

       UpperCamelCase					=  tokenizer.encode('sequence builders'  ,						add_special_tokens=UpperCamelCase__ )
       UpperCamelCase					=  tokenizer.encode('multi-sequence build'  ,						add_special_tokens=UpperCamelCase__ )

       UpperCamelCase					=  tokenizer.build_inputs_with_special_tokens(UpperCamelCase__ )
       UpperCamelCase					=  tokenizer.build_inputs_with_special_tokens(UpperCamelCase__  ,						UpperCamelCase__ )

       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
       ]









from itertools import permutations
def 					snake_case_						(   lowerCAmelCase_				:  tuple					):
							if num[3] % 2 != 0:
														return False

							if (num[2] + num[3] + num[4]) % 3 != 0:
														return False

							if num[5] % 5 != 0:
														return False

							__lowercase					:							Dict			=   [7, 11, 13, 17]
							for i, test in enumerate(lowerCAmelCase_					):
														if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
																					return False
							return True
def 					snake_case_						(   lowerCAmelCase_				:  int = 10					):
							return sum(
							    int("""""".join(map(lowerCAmelCase_				,				lowerCAmelCase_					)					)					)
							    for num in permutations(range(lowerCAmelCase_					)					)
							    if is_substring_divisible(lowerCAmelCase_					)					)


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