

"""simple docstring"""




import unittest
import warnings
from dataclasses import dataclass

from transformers.convert_slow_tokenizer import SpmConverter
from transformers.testing_utils import get_tests_dir





@dataclass
class 				lowerCamelCase  :
			lowerCamelCase__				:						str





class 				lowerCamelCase  (unittest.TestCase     ):

			def    SCREAMING_SNAKE_CASE			(   self			:  List[str]    )				->      List[str]:
						SCREAMING_SNAKE_CASE__									= get_tests_dir("""fixtures/test_sentencepiece.model"""    )
						SCREAMING_SNAKE_CASE__									= get_tests_dir("""fixtures/test_sentencepiece_with_bytefallback.model"""    )

						SCREAMING_SNAKE_CASE__									= FakeOriginalTokenizer(vocab_file=__UpperCAmelCase    )

						with warnings.catch_warnings(record=__UpperCAmelCase    ) as w:
									SCREAMING_SNAKE_CASE__									= SpmConverter(__UpperCAmelCase    )
						self.assertEqual(len(__UpperCAmelCase    )      ,			0    )

						SCREAMING_SNAKE_CASE__									= FakeOriginalTokenizer(vocab_file=__UpperCAmelCase    )

						with warnings.catch_warnings(record=__UpperCAmelCase    ) as w:
									SCREAMING_SNAKE_CASE__									= SpmConverter(__UpperCAmelCase    )
						self.assertEqual(len(__UpperCAmelCase    )      ,			1    )

						self.assertIn(
						    """The sentencepiece tokenizer that you are converting to a fast tokenizer uses the byte fallback option"""
						    """ which is not implemented in the fast tokenizers."""      ,			str(w[0].message    )      ,			)





"""simple docstring"""




import math

def 		A    (       snake_case__      ):




			'''simple docstring'''


			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(snake_case__      ) + 1      )						,			6      ):
						if number % i == 0 or number % (i + 2) == 0:
									return False
			return True

def 		A    (       snake_case__ = 10_00						,			snake_case__ = 10_00      ):




			'''simple docstring'''


			SCREAMING_SNAKE_CASE__									= [0, 0, 0]  # length, a, b
			for a in range((a_limit * -1) + 1						,			snake_case__      ):
						for b in range(2						,			snake_case__      ):
									if is_prime(snake_case__      ):
												SCREAMING_SNAKE_CASE__									= 0
												SCREAMING_SNAKE_CASE__									= 0
												while is_prime((n**2) + (a * n) + b      ):
															count += 1
															n += 1
												if count > longest[0]:
															SCREAMING_SNAKE_CASE__									= [count, a, b]
			SCREAMING_SNAKE_CASE__									= longest[1] * longest[2]
			return ans


if __name__ == "__main__":
						print(solution(1_000, 1_000))


