






"""simple docstring"""





def 					lowerCamelCase__	(							_lowerCamelCase	:		list[int | list]		,    _lowerCamelCase	:		int			)				->    int:
  lowerCamelCase_   					=						0
  for ele in arr:
    total_sum += product_sum(_lowerCamelCase		,    depth + 1			) if isinstance(_lowerCamelCase		,    _lowerCamelCase			) else ele
  return total_sum * depth







def 					lowerCamelCase__	(							_lowerCamelCase	:		list[int | list]			)				->    int:
  return product_sum(_lowerCamelCase		,    1			)


if __name__ == "__main__":
  import doctest

  doctest.testmod()












"""simple docstring"""





from __future__ import annotations







def 					lowerCamelCase__	(							_lowerCamelCase	:		list[int]		,    _lowerCamelCase	:		int			)				->    int:
  lowerCamelCase_					,     lowerCamelCase_   					=						0, len(_lowerCamelCase			) - 1
  while start_ind <= end_ind:
    if array[start_ind] == search_item:
      return start_ind
    elif array[end_ind] == search_item:
      return end_ind
    else:
      start_ind += 1
      end_ind -= 1
    # returns -1 if search_item is not found in array
  return -1


if __name__ == "__main__":
  print(double_linear_search(list(range(100)), 40))




