





import math



def 						A_							(	_lowerCAmelCase				,  _lowerCAmelCase	)		->					int:
 UpperCamelCase      :   str			      =  len(_lowerCAmelCase	)
 UpperCamelCase      :   int			      =  int(math.floor(math.sqrt(_lowerCAmelCase	)	)	)
 UpperCamelCase      :   Union[str, Any]			      =  0
 while arr[min(_lowerCAmelCase				,  _lowerCAmelCase	) - 1] < x:
  UpperCamelCase      :   Union[str, Any]			      =  step
  step += int(math.floor(math.sqrt(_lowerCAmelCase	)	)	)
  if prev >= n:
   return -1

 while arr[prev] < x:
  UpperCamelCase      :   Union[str, Any]			      =  prev + 1
  if prev == min(_lowerCAmelCase				,  _lowerCAmelCase	):
   return -1
 if arr[prev] == x:
  return prev
 return -1


if __name__ == "__main__":
    __lowerCamelCase			:	Union[str, Any]					    =	input("""Enter numbers separated by a comma:\n""").strip()
    __lowerCamelCase			:	Tuple					    =	[int(item) for item in user_input.split(""",""")]
    __lowerCamelCase			:	Union[str, Any]					    =	int(input("""Enter the number to be searched:\n"""))
    __lowerCamelCase			:	Dict					    =	jump_search(arr, x)
    if res == -1:
        print("""Number not found!""")
    else:
        print(f"""Number {x} is at index {res}""")







import os



def 						A_							(	)		->					Union[str, Any]:
 with open(os.path.dirname(_lowerCAmelCase	) + "/grid.txt"	) as f:
  UpperCamelCase      :   Optional[Any]			      =  []  # noqa: E741
  for _ in range(20	):
   l.append([int(_lowerCAmelCase	) for x in f.readline().split()]	)

  UpperCamelCase      :   str			      =  0

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

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

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

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


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