




# Function to print upper half of diamond (pyramid)


def 					_a							(					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 					_a							(					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 					_a							(					lowerCAmelCase )->	List[Any]:
		if n <= 0:
				print('       ...       ....        nothing printing :(' )
				return
		floyd(lowerCAmelCase )  # upper half
		reverse_floyd(lowerCAmelCase )  # lower half


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

						print('''Good Bye...''')





def 					_a							(					lowerCAmelCase    ,						lowerCAmelCase )->	List[str]:
		SCREAMING_SNAKE_CASE_					      =							[1]
		for i in range(2    ,						lowerCAmelCase ):
				factorials.append(factorials[-1] * i )
		assert 0 <= k < factorials[-1] * n, "k out of bounds"

		SCREAMING_SNAKE_CASE_					      =							[]
		SCREAMING_SNAKE_CASE_					      =							list(range(lowerCAmelCase ) )

		# Find permutation
		while factorials:
				SCREAMING_SNAKE_CASE_					      =							factorials.pop()
				SCREAMING_SNAKE_CASE_      ,				SCREAMING_SNAKE_CASE_					      =							divmod(lowerCAmelCase    ,						lowerCAmelCase )
				permutation.append(elements[number] )
				elements.remove(elements[number] )
		permutation.append(elements[0] )

		return permutation


if __name__ == "__main__":
						import doctest

						doctest.testmod()