





'''simple docstring'''




def 	_lowerCAmelCase      (  __snake_case  :			Tuple      )					->					Union[str, 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      (  __snake_case  :			Optional[int]      )					->					Optional[int]:







					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      (  __snake_case  :			Any      )					->					int:







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


if __name__ == "__main__":
		print(r'''| /\ | |- |  |-  |--| |\  /| |-''')
		print(r'''|/  \| |- |_ |_  |__| | \/ | |_''')
		lowercase__   :				Dict      =   1
		while K:
				lowercase__   :				List[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'''




import math






def 	_lowerCAmelCase      (  __snake_case  :			int      )					->					bool:

     if 1 < number < 4:
          # 2 and 3 are primes
          return True
     elif number < 2 or number % 2 == 0 or number % 3 == 0:
          # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
          return False

     # All primes number are in format of 6k +/- 1
     for i in range(5			,							int(math.sqrt(__snake_case      ) + 1      )			,							6      ):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True






def 	_lowerCAmelCase      (  __snake_case  :			float = 0.1      )					->					int:
     __A						:			Dict								=	3
     __A						:			int								=	3

     while primes / (2 * j - 1) >= ratio:
          for i in range(j * j + j + 1			,							(j + 2) * (j + 2)			,							j + 1      ):
               primes += is_prime(__snake_case      )
          j += 2
     return j


if __name__ == "__main__":
  import doctest

  doctest.testmod()