
'''simple docstring'''


def lowercase_	(   _lowercase				)     ->							Optional[Any]:
					'''simple docstring'''

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




def lowercase_	(   _lowercase				)     ->							Dict:
					'''simple docstring'''

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




def lowercase_	(   _lowercase				)     ->							Tuple:
					'''simple docstring'''

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


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

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




'''simple docstring'''


def lowercase_	(   _lowercase = 1_000				)     ->							int:
					'''simple docstring'''

					lowerCamelCase_					:      Any     =		-1
					lowerCamelCase_					:      Optional[Any]     =		0
					for a in range(1			,       n // 3				):
										# Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
										lowerCamelCase_					:      Any     =		(n * n - 2 * a * n) // (2 * n - 2 * a)
										lowerCamelCase_					:      int     =		n - a - b
										if c * c == (a * a + b * b):
															lowerCamelCase_					:      int     =		a * b * c
															if candidate >= product:
																				lowerCamelCase_					:      Any     =		candidate
					return product


if __name__ == "__main__":
					print(f'{solution() = }')


