"""simple docstring"""


from math import sqrt







def 					UpperCAmelCase    (		UpperCAmelCase = 1000000					)				->      int:
     snake_case_					       =					0
     snake_case_					       =					0
     snake_case_					       =					42

     while num_cuboids <= limit:
          max_cuboid_size += 1
          for sum_shortest_sides in range(2						,					2 * max_cuboid_size + 1					):
               if sqrt(sum_shortest_sides**2 + max_cuboid_size**2					).is_integer():
                    num_cuboids += (
                        min(UpperCAmelCase						,					sum_shortest_sides // 2					)
                        - max(1						,					sum_shortest_sides - max_cuboid_size					)
                        + 1
                    )

     return max_cuboid_size


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






from __future__ import annotations

import bisect






def 				A				(					_lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase = 0				, _lowerCamelCase = -1  ):





							'''simple docstring'''




							if hi < 0:
														_lowerCAmelCase     :							int    =    len(_lowerCamelCase  )

							while lo < hi:
														_lowerCAmelCase     :							Optional[Any]    =    lo + (hi - lo) // 2
														if sorted_collection[mid] < item:
																					_lowerCAmelCase     :							Union[str, Any]    =    mid + 1
														else:
																					_lowerCAmelCase     :							str    =    mid

							return lo






def 				A				(					_lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase = 0				, _lowerCamelCase = -1  ):





							'''simple docstring'''




							if hi < 0:
														_lowerCAmelCase     :							str    =    len(_lowerCamelCase  )

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

							return lo






def 				A				(					_lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase = 0				, _lowerCamelCase = -1  ):





							'''simple docstring'''




							sorted_collection.insert(bisect_left(_lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase  )				, _lowerCamelCase  )






def 				A				(					_lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase = 0				, _lowerCamelCase = -1  ):





							'''simple docstring'''




							sorted_collection.insert(bisect_right(_lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase  )				, _lowerCamelCase  )






def 				A				(					_lowerCamelCase				, _lowerCamelCase  ):





							'''simple docstring'''




							_lowerCAmelCase     :							int    =    0
							_lowerCAmelCase     :							Union[str, Any]    =    len(_lowerCamelCase  ) - 1

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






def 				A				(					_lowerCamelCase				, _lowerCamelCase  ):





							'''simple docstring'''




							_lowerCAmelCase     :							Tuple    =    bisect.bisect_left(_lowerCamelCase				, _lowerCamelCase  )
							if index != len(_lowerCamelCase  ) and sorted_collection[index] == item:
														return index
							return None






def 				A				(					_lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase				, _lowerCamelCase  ):





							'''simple docstring'''




							if right < left:
														return None

							_lowerCAmelCase     :							Optional[int]    =    left + (right - left) // 2

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


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