





from __future__ import annotations

import unittest

from transformers import is_tf_available
from transformers.testing_utils import require_sentencepiece, require_tf, require_tokenizers, slow


if is_tf_available():
							import numpy as np
							import tensorflow as tf

							from transformers import TFCamembertModel
@require_tf
@require_sentencepiece
@require_tokenizers
class     UpperCamelCase__					(     unittest.TestCase				):






		'''simple docstring'''






		@slow
		def 						snake_case__				(							self  )       -> Optional[Any]:






									"""simple docstring"""
									lowercase_	:   List[str]  				=     TFCamembertModel.from_pretrained("""jplu/tf-camembert-base"""  )

									lowercase_	:   Dict  				=     tf.convert_to_tensor(
									    [[5, 1_21, 11, 6_60, 16, 7_30, 2_55_43, 1_10, 83, 6]],   dtype=tf.intaa,   )  # J'aime le camembert !"

									lowercase_	:   int  				=     model(SCREAMING_SNAKE_CASE_  )["""last_hidden_state"""]
									lowercase_	:   Any  				=     tf.TensorShape((1, 10, 7_68)  )
									self.assertEqual(output.shape,   SCREAMING_SNAKE_CASE_  )
									# compare the actual values for a slice.
									lowercase_	:   Optional[int]  				=     tf.convert_to_tensor(
									    [[[-0.0254, 0.0235, 0.1027], [0.0606, -0.1811, -0.0418], [-0.1561, -0.1127, 0.2687]]],   dtype=tf.floataa,   )
									# camembert = torch.hub.load('pytorch/fairseq', 'camembert.v0')
									# camembert.eval()
									# expected_slice = roberta.model.forward(input_ids)[0][:, :3, :3].detach()

									self.assertTrue(np.allclose(output[:, :3, :3].numpy(),   expected_slice.numpy(),   atol=1E-4  )  )

"""simple docstring"""




def 							_lowerCamelCase			(			__a     ):
		if divisor % 5 == 0 or divisor % 2 == 0:
				return 0
		SCREAMING_SNAKE_CASE_    			=			1
		SCREAMING_SNAKE_CASE_    			=			1
		while repunit:
				SCREAMING_SNAKE_CASE_    			=			(10 * repunit + 1) % divisor
				repunit_index += 1
		return repunit_index



def 							_lowerCamelCase			(			__a = 1_000_000     ):
		SCREAMING_SNAKE_CASE_    			=			limit - 1
		if divisor % 2 == 0:
				divisor += 1
		while least_divisible_repunit(__a     ) <= limit:
				divisor += 2
		return divisor


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