




'''simple docstring'''


from ...configuration_utils import PretrainedConfig
from ...utils import logging


lowercase_ 		=      logging.get_logger(__name__)

lowercase_ 		=      {
    'google/realm-cc-news-pretrained-embedder': (
        'https://huggingface.co/google/realm-cc-news-pretrained-embedder/resolve/main/config.json'
    ),
    'google/realm-cc-news-pretrained-encoder': (
        'https://huggingface.co/google/realm-cc-news-pretrained-encoder/resolve/main/config.json'
    ),
    'google/realm-cc-news-pretrained-scorer': (
        'https://huggingface.co/google/realm-cc-news-pretrained-scorer/resolve/main/config.json'
    ),
    'google/realm-cc-news-pretrained-openqa': (
        'https://huggingface.co/google/realm-cc-news-pretrained-openqa/aresolve/main/config.json'
    ),
    'google/realm-orqa-nq-openqa': 'https://huggingface.co/google/realm-orqa-nq-openqa/resolve/main/config.json',
    'google/realm-orqa-nq-reader': 'https://huggingface.co/google/realm-orqa-nq-reader/resolve/main/config.json',
    'google/realm-orqa-wq-openqa': 'https://huggingface.co/google/realm-orqa-wq-openqa/resolve/main/config.json',
    'google/realm-orqa-wq-reader': 'https://huggingface.co/google/realm-orqa-wq-reader/resolve/main/config.json',
    # See all REALM models at https://huggingface.co/models?filter=realm
}





class    __lowercase						(  __lowercase ):
   _a							=      '''realm'''







   def __init__(	self      ,							UpperCamelCase=3_0522      ,							UpperCamelCase=768      ,							UpperCamelCase=128      ,							UpperCamelCase=12      ,							UpperCamelCase=12      ,							UpperCamelCase=8      ,							UpperCamelCase=3072      ,							UpperCamelCase="gelu_new"      ,							UpperCamelCase=0.1      ,							UpperCamelCase=0.1      ,							UpperCamelCase=512      ,							UpperCamelCase=2      ,							UpperCamelCase=0.02      ,							UpperCamelCase=1e-12      ,							UpperCamelCase=256      ,							UpperCamelCase=10      ,							UpperCamelCase=1e-3      ,							UpperCamelCase=5      ,							UpperCamelCase=320      ,							UpperCamelCase=1335_3718      ,							UpperCamelCase=5000      ,							UpperCamelCase=1      ,							UpperCamelCase=0      ,							UpperCamelCase=2      ,							**UpperCamelCase      ,							)				->    Any:
     super().__init__(pad_token_id=__a      ,							bos_token_id=__a      ,							eos_token_id=__a      ,							**__a      )

     # Common config
     __a			=					vocab_size
     __a			=					max_position_embeddings
     __a			=					hidden_size
     __a			=					retriever_proj_size
     __a			=					num_hidden_layers
     __a			=					num_attention_heads
     __a			=					num_candidates
     __a			=					intermediate_size
     __a			=					hidden_act
     __a			=					hidden_dropout_prob
     __a			=					attention_probs_dropout_prob
     __a			=					initializer_range
     __a			=					type_vocab_size
     __a			=					layer_norm_eps

     # Reader config
     __a			=					span_hidden_size
     __a			=					max_span_width
     __a			=					reader_layer_norm_eps
     __a			=					reader_beam_size
     __a			=					reader_seq_len

     # Retrieval config
     __a			=					num_block_records
     __a			=					searcher_beam_size









'''simple docstring'''


import os


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

    __a			=					0

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

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

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

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


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



