
'''simple docstring'''



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  _lowercase     ( self				):

												"""simple docstring"""



												_lowerCAmelCase  						=			TFCamembertModel.from_pretrained("""jplu/tf-camembert-base"""				)

												_lowerCAmelCase  						=			tf.convert_to_tensor(
												    [[5, 121, 11, 660, 16, 730, 25_543, 110, 83, 6]]   ,       dtype=tf.intaa   ,       )  # J'aime le camembert !"

												_lowerCAmelCase  						=			model(_lowercase				)["""last_hidden_state"""]
												_lowerCAmelCase  						=			tf.TensorShape((1, 10, 768)				)
												self.assertEqual(output.shape   ,       _lowercase				)
												# compare the actual values for a slice.
												_lowerCAmelCase  						=			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'''



import os


def A				():
						with open(os.path.dirname(__lowerCamelCase		) + """/grid.txt"""		) as f:
												_lowerCAmelCase  						=			[]  # noqa: E741
												for _ in range(20		):
																		l.append([int(__lowerCamelCase		) for x in f.readline().split()]		)

												_lowerCAmelCase  						=			0

												# right
												for i in range(20		):
																		for j in range(17		):
																								_lowerCAmelCase  						=			l[i][j] * l[i][j + 1] * l[i][j + 2] * l[i][j + 3]
																								if temp > maximum:
																														_lowerCAmelCase  						=			temp

        # down
												for i in range(17		):
																		for j in range(20		):
																								_lowerCAmelCase  						=			l[i][j] * l[i + 1][j] * l[i + 2][j] * l[i + 3][j]
																								if temp > maximum:
																														_lowerCAmelCase  						=			temp

        # diagonal 1
												for i in range(17		):
																		for j in range(17		):
																								_lowerCAmelCase  						=			l[i][j] * l[i + 1][j + 1] * l[i + 2][j + 2] * l[i + 3][j + 3]
																								if temp > maximum:
																														_lowerCAmelCase  						=			temp

        # diagonal 2
												for i in range(17		):
																		for j in range(3			,     20		):
																								_lowerCAmelCase  						=			l[i][j] * l[i + 1][j - 1] * l[i + 2][j - 2] * l[i + 3][j - 3]
																								if temp > maximum:
																														_lowerCAmelCase  						=			temp
												return maximum


if __name__ == "__main__":
						print(solution())
