






"""simple docstring"""





from __future__ import annotations



def      __lowercase       (     a			:					list[int]							,		a			:					int			)       ->       int:
      __snake_case      ,					__snake_case   :     int	      =0, len(a			) - 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))










"""simple docstring"""





from itertools import combinations, product



def      __lowercase       (     a			:					int							,		a			:					int							,		a			:					int							,		a			:					int			)       ->       bool:
      if xa == ya == 0 or xa == ya == 0:
            return False
      __snake_case   :     Any	      =xa * xa + ya * ya
      __snake_case   :     Tuple	      =xa * xa + ya * ya
      __snake_case   :     List[Any]	      =(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
      return (
          a_square + b_square == c_square
          or a_square + c_square == b_square
          or b_square + c_square == a_square
      )



def      __lowercase       (     a			:					int = 50			)       ->       int:
      return sum(
          1
          for pta, pta in combinations(product(range(limit + 1			)							,		repeat=2			)							,		2			)
          if is_right(*a							,		*a			)			)


if __name__ == "__main__":
    print(F'''{solution() = }''')


