from __future__ import annotations

import bisect


def    a__       (						__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase = 0   ,					__UpperCamelCase = -1 ):
      if hi < 0:
            SCREAMING_SNAKE_CASE_      =     len(__UpperCamelCase )

      while lo < hi:
            SCREAMING_SNAKE_CASE_      =     lo + (hi - lo) // 2
            if sorted_collection[mid] < item:
                  SCREAMING_SNAKE_CASE_      =     mid + 1
            else:
                  SCREAMING_SNAKE_CASE_      =     mid

      return lo


def    a__       (						__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase = 0   ,					__UpperCamelCase = -1 ):
      if hi < 0:
            SCREAMING_SNAKE_CASE_      =     len(__UpperCamelCase )

      while lo < hi:
            SCREAMING_SNAKE_CASE_      =     lo + (hi - lo) // 2
            if sorted_collection[mid] <= item:
                  SCREAMING_SNAKE_CASE_      =     mid + 1
            else:
                  SCREAMING_SNAKE_CASE_      =     mid

      return lo


def    a__       (						__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase = 0   ,					__UpperCamelCase = -1 ):
      sorted_collection.insert(bisect_left(__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase )   ,					__UpperCamelCase )


def    a__       (						__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase = 0   ,					__UpperCamelCase = -1 ):
      sorted_collection.insert(bisect_right(__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase )   ,					__UpperCamelCase )


def    a__       (						__UpperCamelCase   ,					__UpperCamelCase ):
      SCREAMING_SNAKE_CASE_      =     0
      SCREAMING_SNAKE_CASE_      =     len(__UpperCamelCase ) - 1

      while left <= right:
            SCREAMING_SNAKE_CASE_      =     left + (right - left) // 2
            SCREAMING_SNAKE_CASE_      =     sorted_collection[midpoint]
            if current_item == item:
                  return midpoint
            elif item < current_item:
                  SCREAMING_SNAKE_CASE_      =     midpoint - 1
            else:
                  SCREAMING_SNAKE_CASE_      =     midpoint + 1
      return None


def    a__       (						__UpperCamelCase   ,					__UpperCamelCase ):
      SCREAMING_SNAKE_CASE_      =     bisect.bisect_left(__UpperCamelCase   ,					__UpperCamelCase )
      if index != len(__UpperCamelCase ) and sorted_collection[index] == item:
            return index
      return None


def    a__       (						__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase ):
      if right < left:
            return None

      SCREAMING_SNAKE_CASE_      =     left + (right - left) // 2

      if sorted_collection[midpoint] == item:
            return midpoint
      elif sorted_collection[midpoint] > item:
            return binary_search_by_recursion(__UpperCamelCase   ,					__UpperCamelCase   ,					__UpperCamelCase   ,					midpoint - 1 )
      else:
            return binary_search_by_recursion(__UpperCamelCase   ,					__UpperCamelCase   ,					midpoint + 1   ,					__UpperCamelCase )


if __name__ == "__main__":
      A   :     Any       =				input("Enter numbers separated by comma:\n").strip()
      A   :     Dict       =				sorted(int(item) for item in user_input.split(","))
      A   :     str       =				int(input("Enter a single number to be found in the list:\n"))
      A   :     str       =				binary_search(collection, target)
      if result is None:
            print(f"{target} was not found in {collection}.")
      else:
            print(f"{target} was found at position {result} in {collection}.")



def    a__       (						__UpperCamelCase = 1_0_0_0 ):
      SCREAMING_SNAKE_CASE_      =     -1
      SCREAMING_SNAKE_CASE_      =     0
      for a in range(1   ,					n // 3 ):
            # Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
            SCREAMING_SNAKE_CASE_      =     (n * n - 2 * a * n) // (2 * n - 2 * a)
            SCREAMING_SNAKE_CASE_      =     n - a - b
            if c * c == (a * a + b * b):
                  SCREAMING_SNAKE_CASE_      =     a * b * c
                  if candidate >= product:
                        SCREAMING_SNAKE_CASE_      =     candidate
      return product


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


