



'''simple docstring'''





import os
def        _SCREAMING_SNAKE_CASE  (	UpperCamelCase      ):



    """simple docstring"""





    lowerCAmelCase__			:  List[str]											= len(grid[0]      )
    lowerCAmelCase__			:  int											= len(UpperCamelCase      )

    lowerCAmelCase__			:  Optional[int]											= 0
    lowerCAmelCase__			:  Tuple											= 0
    lowerCAmelCase__			:  Optional[Any]											= 0

    # Check vertically, horizontally, diagonally at the same time (only works
    # for nxn grid)
    for i in range(UpperCamelCase      ):
        for j in range(n_rows - 3      ):
            lowerCAmelCase__			:  str											= grid[j][i] * grid[j + 1][i] * grid[j + 2][i] * grid[j + 3][i]
            lowerCAmelCase__			:  Optional[int]											= grid[i][j] * grid[i][j + 1] * grid[i][j + 2] * grid[i][j + 3]

            # Left-to-right diagonal (\) product
            if i < n_columns - 3:
                lowerCAmelCase__			:  Optional[int]											= (
                    grid[i][j]
                    * grid[i + 1][j + 1]
                    * grid[i + 2][j + 2]
                    * grid[i + 3][j + 3]
                )

            # Right-to-left diagonal(/) product
            if i > 2:
                lowerCAmelCase__			:  Tuple											= (
                    grid[i][j]
                    * grid[i - 1][j + 1]
                    * grid[i - 2][j + 2]
                    * grid[i - 3][j + 3]
                )

            lowerCAmelCase__			:  Dict											= max(
                UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase      )
            if max_product > largest:
                lowerCAmelCase__			:  Any											= max_product

    return largest
def        _SCREAMING_SNAKE_CASE  (	):



    """simple docstring"""





    lowerCAmelCase__			:  List[str]											= []
    with open(os.path.dirname(UpperCamelCase      ) + """/grid.txt"""      ) as file:
        for line in file:
            grid.append(line.strip("""\n"""      ).split(""" """      )      )

    lowerCAmelCase__			:  Dict											= [[int(UpperCamelCase      ) for i in grid[j]] for j in range(len(UpperCamelCase      )      )]

    return largest_product(UpperCamelCase      )


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







'''simple docstring'''





from __future__ import annotations

# This is the precision for this function which can be altered.
# It is recommended for users to keep this number greater than or equal to 10.
_lowerCAmelCase										=     10
def        _SCREAMING_SNAKE_CASE  (	UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase      ):



    """simple docstring"""





    for i in range(UpperCamelCase							,   UpperCamelCase      ):
        if array[i] == target:
            return i
    return -1
def        _SCREAMING_SNAKE_CASE  (	UpperCamelCase							,   UpperCamelCase      ):



    """simple docstring"""





    lowerCAmelCase__			:  Optional[Any]											= 0
    lowerCAmelCase__			:  Optional[int]											= len(UpperCamelCase      )
    while left <= right:
        if right - left < precision:
            return lin_search(UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase      )

        lowerCAmelCase__			:  Tuple											= (left + right) // 3 + 1
        lowerCAmelCase__			:  List[str]											= 2 * (left + right) // 3 + 1

        if array[one_third] == target:
            return one_third
        elif array[two_third] == target:
            return two_third

        elif target < array[one_third]:
            lowerCAmelCase__			:  int											= one_third - 1
        elif array[two_third] < target:
            lowerCAmelCase__			:  Union[str, Any]											= two_third + 1

        else:
            lowerCAmelCase__			:  List[Any]											= one_third + 1
            lowerCAmelCase__			:  List[str]											= two_third - 1
    else:
        return -1
def        _SCREAMING_SNAKE_CASE  (	UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase      ):



    """simple docstring"""





    if left < right:
        if right - left < precision:
            return lin_search(UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase      )
        lowerCAmelCase__			:  Dict											= (left + right) // 3 + 1
        lowerCAmelCase__			:  Tuple											= 2 * (left + right) // 3 + 1

        if array[one_third] == target:
            return one_third
        elif array[two_third] == target:
            return two_third

        elif target < array[one_third]:
            return rec_ternary_search(UpperCamelCase							,   one_third - 1							,   UpperCamelCase							,   UpperCamelCase      )
        elif array[two_third] < target:
            return rec_ternary_search(two_third + 1							,   UpperCamelCase							,   UpperCamelCase							,   UpperCamelCase      )
        else:
            return rec_ternary_search(one_third + 1							,   two_third - 1							,   UpperCamelCase							,   UpperCamelCase      )
    else:
        return -1


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 _lowerCAmelCase										=     input('''Enter numbers separated by comma:\n''').strip()
 _lowerCAmelCase										=     [int(item.strip()) for item in user_input.split(''',''')]
 assert collection == sorted(collection), F"List must be ordered.\n{collection}."
 _lowerCAmelCase										=     int(input('''Enter the number to be found in the list:\n''').strip())
 _lowerCAmelCase										=     ite_ternary_search(collection, target)
 _lowerCAmelCase										=     rec_ternary_search(0, len(collection) - 1, collection, target)
 if resulta != -1:
  print(F"""Iterative search: {target} found at positions: {resulta}""")
  print(F"""Recursive search: {target} found at positions: {resulta}""")
 else:
  print('''Not found''')


