


'''simple docstring'''

import pytest

from datasets import inspect_metric, list_metrics, load_metric

@pytest.fixture
def 							__magic_name__(  lowerCamelCase):
						monkeypatch.setattr('''datasets.utils.deprecation_utils._emitted_deprecation_warnings''', set())

@pytest.fixture
def 							__magic_name__(  lowerCamelCase):


						class 					a__ :







										"""simple docstring"""



										def __init__(self				,	__lowercase						):
																__lowerCAmelCase											= metric_id


						class 					a__ :







										"""simple docstring"""



										__UpperCamelCase			:						Optional[Any]		=		[MetricMock(__A					) for metric_id in ['accuracy', 'mse', 'precision', 'codeparrot/apps_metric']]




										def     _snake_case     (self						):
																return self._metrics

						monkeypatch.setattr('''datasets.inspect.huggingface_hub''', HfhMock())




@pytest.mark.parametrize(
    '''func, args''', [(load_metric, ('''metrics/mse''',)), (list_metrics, ()), (inspect_metric, ('''metrics/mse''', '''tmp_path'''))])
def 							__magic_name__(  lowerCamelCase, lowerCamelCase, lowerCamelCase, lowerCamelCase, lowerCamelCase):
						if "tmp_path" in args:
												__lowerCAmelCase											= tuple(arg if arg != '''tmp_path''' else tmp_path for arg in args)
						with pytest.warns(A__, match='''https://huggingface.co/docs/evaluate'''):
												func(*A__)









"""simple docstring"""
import os

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

						UpperCAmelCase_     : Any			     =					0

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

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

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

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


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



