






'''simple docstring'''







from __future__ import annotations

import bisect





def 		_UpperCAmelCase   (							__A							:   list[int]						,		__A							:   int						,		__A							:   int = 0						,		__A							:   int = -1      ):
				if hi < 0:
								a_		:  Optional[Any]											=      len(__A      )

				while lo < hi:
								a_		:  Optional[int]											=      lo + (hi - lo) // 2
								if sorted_collection[mid] < item:
												a_		:  List[str]											=      mid + 1
								else:
												a_		:  List[str]											=      mid

				return lo





def 		_UpperCAmelCase   (							__A							:   list[int]						,		__A							:   int						,		__A							:   int = 0						,		__A							:   int = -1      ):
				if hi < 0:
								a_		:  int											=      len(__A      )

				while lo < hi:
								a_		:  int											=      lo + (hi - lo) // 2
								if sorted_collection[mid] <= item:
												a_		:  List[str]											=      mid + 1
								else:
												a_		:  Dict											=      mid

				return lo





def 		_UpperCAmelCase   (							__A							:   list[int]						,		__A							:   int						,		__A							:   int = 0						,		__A							:   int = -1      ):
				sorted_collection.insert(bisect_left(__A						,		__A						,		__A						,		__A      )						,		__A      )





def 		_UpperCAmelCase   (							__A							:   list[int]						,		__A							:   int						,		__A							:   int = 0						,		__A							:   int = -1      ):
				sorted_collection.insert(bisect_right(__A						,		__A						,		__A						,		__A      )						,		__A      )





def 		_UpperCAmelCase   (							__A							:   list[int]						,		__A							:   int      ):
				a_		:  Any											=      0
				a_		:  int											=      len(__A      ) - 1

				while left <= right:
								a_		:  Optional[Any]											=      left + (right - left) // 2
								a_		:  Union[str, Any]											=      sorted_collection[midpoint]
								if current_item == item:
												return midpoint
								elif item < current_item:
												a_		:  str											=      midpoint - 1
								else:
												a_		:  str											=      midpoint + 1
				return None





def 		_UpperCAmelCase   (							__A							:   list[int]						,		__A							:   int      ):
				a_		:  Optional[int]											=      bisect.bisect_left(__A						,		__A      )
				if index != len(__A      ) and sorted_collection[index] == item:
								return index
				return None





def 		_UpperCAmelCase   (							__A							:   list[int]						,		__A							:   int						,		__A							:   int						,		__A							:   int      ):
				if right < left:
								return None

				a_		:  Any											=      left + (right - left) // 2

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


if __name__ == "__main__":
		__lowerCAmelCase       		=      input('Enter numbers separated by comma:\n').strip()
		__lowerCAmelCase       		=      sorted(int(item) for item in user_input.split(','))
		__lowerCAmelCase       		=      int(input('Enter a single number to be found in the list:\n'))
		__lowerCAmelCase       		=      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}.""")












'''simple docstring'''







import sys

__lowerCAmelCase       		=      (
    '73167176531330624919225119674426574742355349194934'
    '96983520312774506326239578318016984801869478851843'
    '85861560789112949495459501737958331952853208805511'
    '12540698747158523863050715693290963295227443043557'
    '66896648950445244523161731856403098711121722383113'
    '62229893423380308135336276614282806444486645238749'
    '30358907296290491560440772390713810515859307960866'
    '70172427121883998797908792274921901699720888093776'
    '65727333001053367881220235421809751254540594752243'
    '52584907711670556013604839586446706324415722155397'
    '53697817977846174064955149290862569321978468622482'
    '83972241375657056057490261407972968652414535100474'
    '82166370484403199890008895243450658541227588666881'
    '16427171479924442928230863465674813919123162824586'
    '17866458359124566529476545682848912883142607690042'
    '24219022671055626321111109370544217506941658960408'
    '07198403850962455444362981230987879927244284909188'
    '84580156166097919133875499200524063689912560717606'
    '05886116467109405077541002256983155200055935729725'
    '71636269561882670428252483600823257530420752963450'
)





def 		_UpperCAmelCase   (							__A							:   str      ):
				a_		:  Tuple											=      1
				for digit in s:
								product *= int(__A      )
				return product





def 		_UpperCAmelCase   (							__A							:   str = N      ):
				a_		:  Dict											=      -sys.maxsize - 1
				a_		:  Optional[int]											=      n[:13]
				a_		:  str											=      13
				while cur_index < len(__A      ) - 13:
								if int(n[cur_index]      ) >= int(substr[0]      ):
												a_		:  Tuple											=      substr[1:] + n[cur_index]
												cur_index += 1
								else:
												a_		:  Dict											=      max(__A						,		str_eval(__A      )      )
												a_		:  List[str]											=      n[cur_index : cur_index + 13]
												cur_index += 13
				return largest_product


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




