





'''simple docstring'''




import pytest
import requests

from datasets.utils.file_utils import http_head

from .utils import OfflineSimulationMode, RequestWouldHangIndefinitelyError, offline
@pytest.mark.integration
def 	UpperCAmelCase_							(					)		->       List[str]:


     '''simple docstring'''



     with offline(OfflineSimulationMode.CONNECTION_TIMES_OUT       ):
          with pytest.raises(_lowerCamelCase       ):
               requests.request("GET"			,     "https://huggingface.co"       )
          with pytest.raises(requests.exceptions.ConnectTimeout       ):
               requests.request("GET"			,     "https://huggingface.co"			,     timeout=1.0       )
@pytest.mark.integration
def 	UpperCAmelCase_							(					)		->       Tuple:


     '''simple docstring'''



     with offline(OfflineSimulationMode.CONNECTION_FAILS       ):
          with pytest.raises(requests.exceptions.ConnectionError       ):
               requests.request("GET"			,     "https://huggingface.co"       )






def 	UpperCAmelCase_							(					)		->       Optional[int]:


     '''simple docstring'''



     with offline(OfflineSimulationMode.HF_DATASETS_OFFLINE_SET_TO_1       ):
          with pytest.raises(_lowerCamelCase       ):
               http_head("https://huggingface.co"       )












"""simple docstring"""





import os







def      lowerCamelCase__       (							)      ->				List[Any]:
  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())




