





import math






def 				_UpperCAmelCase			(    A     ):




   '''simple docstring'''

   UpperCAmelCase__						=0
   UpperCAmelCase__						=0
   while num > 0:
      UpperCAmelCase__						=num % 8
      UpperCAmelCase__						=octal + (remainder * math.floor(math.pow(10				,							snake_case__     )     ))
      counter += 1
      UpperCAmelCase__						=math.floor(num / 8     )  # basically /= 8 without remainder if any
      # This formatting removes trailing '.0' from `octal`.
   return F"""0o{int(snake_case__     )}"""






def 				_UpperCAmelCase			(    ):




   '''simple docstring'''

   print("\n2 in octal is:"     )
   print(decimal_to_octal(2     )     )  # = 2
   print("\n8 in octal is:"     )
   print(decimal_to_octal(8     )     )  # = 10
   print("\n65 in octal is:"     )
   print(decimal_to_octal(65     )     )  # = 101
   print("\n216 in octal is:"     )
   print(decimal_to_octal(216     )     )  # = 330
   print("\n512 in octal is:"     )
   print(decimal_to_octal(512     )     )  # = 1000
   print("\n"     )


if __name__ == "__main__":
    main()











"""simple docstring"""
from __future__ import annotations






def       __UpperCamelCase						(		snake_case__ , snake_case__       ):
	if len(snake_case__       ) == 0:
		return False
	A_		:    Union[str, Any]						     = len(snake_case__       ) // 2
	if a_list[midpoint] == item:
		return True
	if item < a_list[midpoint]:
		return binary_search(a_list[:midpoint] , snake_case__       )
	else:
		return binary_search(a_list[midpoint + 1 :] , snake_case__       )


if __name__ == "__main__":
							_lowerCAmelCase       =				input("Enter numbers separated by comma:\n").strip()
							_lowerCAmelCase       =				[int(item.strip()) for item in user_input.split(",")]
							_lowerCAmelCase       =				int(input("Enter the number to be found in the list:\n").strip())
							_lowerCAmelCase       =				"" if binary_search(sequence, target) else "not "
							print(F'{target} was {not_str}found in {sequence}')

