

'''simple docstring'''





from argparse import ArgumentParser

from datasets.commands.convert import ConvertCommand
from datasets.commands.dummy_data import DummyDataCommand
from datasets.commands.env import EnvironmentCommand
from datasets.commands.run_beam import RunBeamCommand
from datasets.commands.test import TestCommand
from datasets.utils.logging import set_verbosity_info
def   a   (    A__			:     Optional[Any]  )					->   Union[str, Any]:





      """simple docstring"""



      return {key.lstrip('-'  ): value for key, value in zip(unknown_args[::2]   ,     unknown_args[1::2]  )}
def   a   (    )					->   Tuple:





      """simple docstring"""



      _lowercase			 =ArgumentParser(
          'HuggingFace Datasets CLI tool'   ,     usage='datasets-cli <command> [<args>]'   ,     allow_abbrev=_snake_case  )
      _lowercase			 =parser.add_subparsers(help='datasets-cli command helpers'  )
      set_verbosity_info()

      # Register commands
      ConvertCommand.register_subcommand(_snake_case  )
      EnvironmentCommand.register_subcommand(_snake_case  )
      TestCommand.register_subcommand(_snake_case  )
      RunBeamCommand.register_subcommand(_snake_case  )
      DummyDataCommand.register_subcommand(_snake_case  )

      # Parse args
      _lowercase , _lowercase			 =parser.parse_known_args()
      if not hasattr(_snake_case   ,     'func'  ):
            parser.print_help()
            exit(1  )
      _lowercase			 =parse_unknown_args(_snake_case  )

      # Run
      _lowercase			 =args.func(_snake_case   ,     **_snake_case  )
      service.run()


if __name__ == "__main__":
  main()





import os
def   a   (    )					->   Optional[int]:





      """simple docstring"""



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

            _lowercase			 =0

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

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

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

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


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


