



# Function to print upper half of diamond (pyramid)



def 		lowerCAmelCase__     (       UpperCamelCase_					:							Optional[Any]						)->	Any:
    for i in range(0			,							UpperCamelCase_						):
        for _ in range(0			,							n - i - 1						):  # printing spaces
            print(''' '''			,							end=''''''						)
        for _ in range(0			,							i + 1						):  # printing stars
            print('''* '''			,							end=''''''						)
        print()



def 		lowerCAmelCase__     (       UpperCamelCase_					:							Tuple						)->	str:
    for i in range(UpperCamelCase_			,							0			,							-1						):
        for _ in range(UpperCamelCase_			,							0			,							-1						):  # printing stars
            print('''* '''			,							end=''''''						)
        print()
        for _ in range(n - i + 1			,							0			,							-1						):  # printing spaces
            print(''' '''			,							end=''''''						)



def 		lowerCAmelCase__     (       UpperCamelCase_					:							List[str]						)->	Union[str, Any]:
    if n <= 0:
        print('''       ...       ....        nothing printing :('''						)
        return
    floyd(UpperCamelCase_						)  # upper half
    reverse_floyd(UpperCamelCase_						)  # lower half


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

   print("Good Bye...")





def 		lowerCAmelCase__     (       UpperCamelCase_					:							int						)->	int:
    A__					=       1
    for i in range(1			,							num + 1						):
        fact *= i
    return fact



def 		lowerCAmelCase__     (       UpperCamelCase_					:							int						)->	int:
    A__					=       0
    while number > 0:
        A__					=       number % 1_0
        sum_of_digits += last_digit
        A__					=       number // 1_0  # Removing the last_digit from the given number
    return sum_of_digits



def 		lowerCAmelCase__     (       UpperCamelCase_					:							int = 1_0_0						)->	int:
    A__					=       factorial(UpperCamelCase_						)
    A__					=       split_and_add(UpperCamelCase_						)
    return result


if __name__ == "__main__":
   print(solution(int(input("Enter the Number: ").strip())))
