





'''simple docstring'''

# Function to print upper half of diamond (pyramid)





def 		UpperCamelCase							(				_lowerCamelCase   :   Optional[int]			):
    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 		UpperCamelCase							(				_lowerCamelCase   :   Tuple			):
    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 		UpperCamelCase							(				_lowerCamelCase   :   Optional[int]			):
    if n <= 0:
        print("       ...       ....        nothing printing :("			)
        return
    floyd(_lowerCamelCase			)  # upper half
    reverse_floyd(_lowerCamelCase			)  # lower half


if __name__ == "__main__":
  print(R"| /\ | |- |  |-  |--| |\  /| |-")
  print(R"|/  \| |- |_ |_  |__| | \/ | |_")
  __lowerCAmelCase				:      List[Any]						      =1
  while K:
    __lowerCAmelCase				:      Dict						      =int(input("enter the number and , and see the magic : "))
    print()
    pretty_print(user_number)
    __lowerCAmelCase				:      Dict						      =int(input("press 0 to exit... and 1 to continue..."))

  print("Good Bye...")










'''simple docstring'''

from __future__ import annotations





def 		UpperCamelCase							(				_lowerCamelCase   :   list[int]			):  # This function is recursive
    A__							=     len(_lowerCamelCase			)
    # If the array contains only one element, we return it (it's the stop condition of
    # recursion)
    if array_length <= 1:
        return array
        # Else
    A__							=     array[0]
    A__							=     False
    A__							=     1
    A__							=     []
    while not is_found and i < array_length:
        if array[i] < pivot:
            A__							=     True
            A__							=     [element for element in array[i:] if element >= array[i]]
            A__							=     longest_subsequence(_lowerCamelCase			)
            if len(_lowerCamelCase			) > len(_lowerCamelCase			):
                A__							=     temp_array
        else:
            i += 1

    A__							=     [element for element in array[1:] if element >= pivot]
    A__							=     [pivot, *longest_subsequence(_lowerCamelCase			)]
    if len(_lowerCamelCase			) > len(_lowerCamelCase			):
        return temp_array
    else:
        return longest_subseq


if __name__ == "__main__":
  import doctest

  doctest.testmod()



