






"""simple docstring"""
# Function to print upper half of diamond (pyramid)





def 				lowercase__		(					lowerCamelCase       ):
				for i in range(0,						lowerCamelCase       ):
								for _ in range(0,						n - i - 1       ):  # printing spaces
												print(' ',						end=''       )
								for _ in range(0,						i + 1       ):  # printing stars
												print('* ',						end=''       )
								print()





def 				lowercase__		(					lowerCamelCase       ):
				for i in range(lowerCamelCase,						0,						-1       ):
								for _ in range(lowerCamelCase,						0,						-1       ):  # printing stars
												print('* ',						end=''       )
								print()
								for _ in range(n - i + 1,						0,						-1       ):  # printing spaces
												print(' ',						end=''       )





def 				lowercase__		(					lowerCamelCase       ):
				if n <= 0:
								print('       ...       ....        nothing printing :('       )
								return
				floyd(lowerCamelCase       )  # upper half
				reverse_floyd(lowerCamelCase       )  # lower half


if __name__ == "__main__":
			print(r'| /\ | |- |  |-  |--| |\  /| |-')
			print(r'|/  \| |- |_ |_  |__| | \/ | |_')
			lowerCAmelCase__    						=			1
			while K:
						lowerCAmelCase__    						=			int(input('enter the number and , and see the magic : '))
						print()
						pretty_print(user_number)
						lowerCAmelCase__    						=			int(input('press 0 to exit... and 1 to continue...'))

			print('Good Bye...')









"""simple docstring"""
class _lowerCAmelCase						:







						def __init__(    self   ,				lowerCAmelCase_							)		->							None:
										_SCREAMING_SNAKE_CASE   :		Dict       		=    size
										_SCREAMING_SNAKE_CASE   :		str       		=    [0] * size
										_SCREAMING_SNAKE_CASE   :		Any       		=    [0] * size







						@staticmethod
						def 			A      (    lowerCAmelCase_							)		->							int:
										return index | (index + 1)







						@staticmethod
						def 			A      (    lowerCAmelCase_							)		->							int:
										return (index & (index + 1)) - 1







						def 			A      (    self   ,				lowerCAmelCase_   ,				lowerCAmelCase_							)		->							None:
										_SCREAMING_SNAKE_CASE   :		str       		=    value
										while index < self.size:
														_SCREAMING_SNAKE_CASE   :		List[str]       		=    self.get_prev(lowerCAmelCase_							) + 1
														if current_left_border == index:
																		_SCREAMING_SNAKE_CASE   :		List[str]       		=    value
														else:
																		_SCREAMING_SNAKE_CASE   :		Optional[Any]       		=    max(lowerCAmelCase_   ,				lowerCAmelCase_   ,				lowerCAmelCase_							)
														_SCREAMING_SNAKE_CASE   :		str       		=    self.get_next(lowerCAmelCase_							)







						def 			A      (    self   ,				lowerCAmelCase_   ,				lowerCAmelCase_							)		->							int:
										right -= 1  # Because of right is exclusive
										_SCREAMING_SNAKE_CASE   :		List[Any]       		=    0
										while left <= right:
														_SCREAMING_SNAKE_CASE   :		Union[str, Any]       		=    self.get_prev(lowerCAmelCase_							)
														if left <= current_left:
																		_SCREAMING_SNAKE_CASE   :		Union[str, Any]       		=    max(lowerCAmelCase_   ,				self.tree[right]							)
																		_SCREAMING_SNAKE_CASE   :		List[Any]       		=    current_left
														else:
																		_SCREAMING_SNAKE_CASE   :		List[str]       		=    max(lowerCAmelCase_   ,				self.arr[right]							)
																		right -= 1
										return result


if __name__ == "__main__":
			import doctest

			doctest.testmod()

