

'''simple docstring'''





import os

try:
  from .build_directory_md import good_file_paths
except ImportError:
  from build_directory_md import good_file_paths  # type: ignore

lowercase_             =     list(good_file_paths())
assert filepaths, "good_file_paths() failed!"

lowercase_             =     [file for file in filepaths if file != file.lower()]
if upper_files:
  print(f"{len(upper_files)} files contain uppercase characters:")
  print('\n'.join(upper_files) + '\n')

lowercase_             =     [file for file in filepaths if ' ' in file]
if space_files:
  print(f"{len(space_files)} files contain space characters:")
  print('\n'.join(space_files) + '\n')

lowercase_             =     [file for file in filepaths if '-' in file]
if hyphen_files:
  print(f"{len(hyphen_files)} files contain hyphen characters:")
  print('\n'.join(hyphen_files) + '\n')

lowercase_             =     [file for file in filepaths if os.sep not in file]
if nodir_files:
  print(f"{len(nodir_files)} files are not in a directory:")
  print('\n'.join(nodir_files) + '\n')

lowercase_             =     len(upper_files + space_files + hyphen_files + nodir_files)
if bad_files:
  import sys

  sys.exit(bad_files)





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())


