



def       lowerCAmelCase_     (lowerCAmelCase__:						list   ):





			"""simple docstring"""


			UpperCAmelCase_:						Optional[int]					=			len(_A   )
			for i in range(1						,		_A   ):
						UpperCAmelCase_:						Tuple					=			collection[i]
						UpperCAmelCase_:						Any					=			0
						UpperCAmelCase_:						List[Any]					=			i - 1

						while low <= high:
									UpperCAmelCase_:						Any					=			(low + high) // 2
									if val < collection[mid]:
												UpperCAmelCase_:						Optional[int]					=			mid - 1
									else:
												UpperCAmelCase_:						Tuple					=			mid + 1
						for j in range(_A						,		_A						,		-1   ):
									UpperCAmelCase_:						Optional[int]					=			collection[j - 1]
						UpperCAmelCase_:						List[Any]					=			val
			return collection


if __name__ == "__main__":
	a	:   Union[str, Any]       			=       input('Enter numbers separated by a comma:\n').strip()
	a	:   Union[str, Any]       			=       [int(item) for item in user_input.split(',')]
	print(binary_insertion_sort(unsorted))









import os




def 			UpperCAmelCase__				(			_A      : Any							):





  '''simple docstring'''







  a__  =len(grid[0]							)
  a__  =len(_A							)

  a__  =0
  a__  =0
  a__  =0

  # Check vertically, horizontally, diagonally at the same time (only works
  # for nxn grid)
  for i in range(_A							):
    for j in range(n_rows - 3							):
      a__  =grid[j][i] * grid[j + 1][i] * grid[j + 2][i] * grid[j + 3][i]
      a__  =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:
        a__  =(
            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:
        a__  =(
            grid[i][j]
            * grid[i - 1][j + 1]
            * grid[i - 2][j + 2]
            * grid[i - 3][j + 3]
        )

      a__  =max(
          _A	,      _A	,      _A	,      _A							)
      if max_product > largest:
        a__  =max_product

  return largest




def 			UpperCAmelCase__				(			):





  '''simple docstring'''







  a__  =[]
  with open(os.path.dirname(_A							) + '''/grid.txt'''							) as file:
    for line in file:
      grid.append(line.strip('''\n'''							).split(''' '''							)							)

  a__  =[[int(_A							) for i in grid[j]] for j in range(len(_A							)							)]

  return largest_product(_A							)


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