


def 				UpperCAmelCase_					(							__snake_case						)     ->			str:







 """simple docstring"""


 _lowercase							      =int(_A						)
 if decimal in (0, 1):  # Exit cases for the recursion
  return str(_A						)
 _lowercase							      =divmod(_A     ,						2						)
 return binary_recursive(_A						) + str(_A						)
def 				UpperCAmelCase_					(							__snake_case						)     ->			Dict:







 """simple docstring"""


 _lowercase							      =str(_A						).strip()
 if not number:
  raise ValueError('''No input value was provided'''						)
 _lowercase							      ="-" if number.startswith('''-'''						) else ""
 _lowercase							      =number.lstrip('''-'''						)
 if not number.isnumeric():
  raise ValueError('''Input value is not an integer'''						)
 return F"{negative}0b{binary_recursive(int(_A						)						)}"


if __name__ == "__main__":
  from doctest import testmod

  testmod()





class 			_lowercase :


       """simple docstring"""




       def __init__(   self							:			Any					,      __lowerCamelCase							:			int       ):


             '''simple docstring'''



             lowerCamelCase__		:				List[str]    =  n
             lowerCamelCase__		:				Union[str, Any]    =  [None] * self.n
             lowerCamelCase__		:				List[str]    =  0  # index of the first element
             lowerCamelCase__		:				Any    =  0
             lowerCamelCase__		:				Any    =  0





       def __len__(   self							:			Tuple       ):


             '''simple docstring'''



             return self.size





       def 						lowerCAmelCase     (   self							:			Optional[int]       ):


             '''simple docstring'''



             return self.size == 0





       def 						lowerCAmelCase     (   self							:			Union[str, Any]       ):


             '''simple docstring'''



             return False if self.is_empty() else self.array[self.front]





       def 						lowerCAmelCase     (   self							:			str					,      __lowerCamelCase							:			List[str]       ):


             '''simple docstring'''



             if self.size >= self.n:
                   raise Exception("QUEUE IS FULL"       )

             lowerCamelCase__		:				Optional[Any]    =  data
             lowerCamelCase__		:				Tuple    =  (self.rear + 1) % self.n
             self.size += 1
             return self





       def 						lowerCAmelCase     (   self							:			Tuple       ):


             '''simple docstring'''



             if self.size == 0:
                   raise Exception("UNDERFLOW"       )

             lowerCamelCase__		:				Any    =  self.array[self.front]
             lowerCamelCase__		:				List[Any]    =  None
             lowerCamelCase__		:				str    =  (self.front + 1) % self.n
             self.size -= 1
             return temp


