

from __future__ import annotations




def        lowerCAmelCase(	SCREAMING_SNAKE_CASE_       )->		list[int]:



    """simple docstring"""






    assert (
        isinstance(SCREAMING_SNAKE_CASE_       ,		SCREAMING_SNAKE_CASE_       ) and mask > 0
    ), f"mask needs to be positive integer, your input {mask}"
    UpperCamelCase_          =		[]
    UpperCamelCase_          =		mask

    while submask:
        all_submasks.append(SCREAMING_SNAKE_CASE_       )
        UpperCamelCase_          =		(submask - 1) & mask

    return all_submasks


if __name__ == "__main__":
 import doctest

 doctest.testmod()



class 		__magic_name__ :






     def __init__(							self     )->			int:
         UpperCamelCase_          =		[0]
         UpperCamelCase_          =		0






     def      UpperCAmelCase_							(							self						,		_lowercase     )->			None:
         UpperCamelCase_          =		self.__heap[i]
         while i // 2 > 0:
             if self.__heap[i] > self.__heap[i // 2]:
                 UpperCamelCase_          =		self.__heap[i // 2]
                 UpperCamelCase_          =		temporary
             i //= 2






     def      UpperCAmelCase_							(							self						,		_lowercase     )->			None:
         self.__heap.append(_lowercase     )
         self.__size += 1
         self.__swap_up(self.__size     )






     def      UpperCAmelCase_							(							self						,		_lowercase     )->			None:
         while self.__size >= 2 * i:
             if 2 * i + 1 > self.__size:
                 UpperCamelCase_          =		2 * i
             else:
                 if self.__heap[2 * i] > self.__heap[2 * i + 1]:
                     UpperCamelCase_          =		2 * i
                 else:
                     UpperCamelCase_          =		2 * i + 1
             UpperCamelCase_          =		self.__heap[i]
             if self.__heap[i] < self.__heap[bigger_child]:
                 UpperCamelCase_          =		self.__heap[bigger_child]
                 UpperCamelCase_          =		temporary
             UpperCamelCase_          =		bigger_child






     def      UpperCAmelCase_							(							self     )->			int:
         UpperCamelCase_          =		self.__heap[1]
         UpperCamelCase_          =		self.__heap[self.__size]
         self.__size -= 1
         self.__heap.pop()
         self.__swap_down(1     )
         return max_value






     @property
     def      UpperCAmelCase_							(							self     )->			List[Any]:
         return self.__heap[1:]






     def __len__(							self     )->			List[str]:
         return self.__size


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 # create an instance of BinaryHeap
 SCREAMING_SNAKE_CASE						:Optional[int]      =			BinaryHeap()
 binary_heap.insert(6)
 binary_heap.insert(10)
 binary_heap.insert(15)
 binary_heap.insert(12)
 # pop root(max-values because it is max heap)
 print(binary_heap.pop())  # 15
 print(binary_heap.pop())  # 12
 # get the list and size after operations
 print(binary_heap.get_list)
 print(len(binary_heap))
