# Function to print upper half of diamond (pyramid)






def   __A		(			_A					):



 """simple docstring"""


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



def   __A		(			_A					):



 """simple docstring"""


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



def   __A		(			_A					):



 """simple docstring"""


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


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

  print("""Good Bye...""")







from __future__ import annotations
class    A_ :

  def __init__(		self :      Union[str, Any]     ,							__SCREAMING_SNAKE_CASE :      int       ):
   __a       =  order

   # a_{0} ... a_{k}
   __a       =  [1.0] + [0.0] * order
   # b_{0} ... b_{k}
   __a       =  [1.0] + [0.0] * order

   # x[n-1] ... x[n-k]
   __a       =  [0.0] * self.order
   # y[n-1] ... y[n-k]
   __a       =  [0.0] * self.order

  def 		_UpperCAmelCase   (		self :      Union[str, Any]     ,							__SCREAMING_SNAKE_CASE :      list[float]     ,							__SCREAMING_SNAKE_CASE :      list[float]       ):
   if len(__SCREAMING_SNAKE_CASE       ) < self.order:
    __a       =  [1.0, *a_coeffs]

   if len(__SCREAMING_SNAKE_CASE       ) != self.order + 1:
    __a       =  (
        f"""Expected a_coeffs to have {self.order + 1} elements """
        f"""for {self.order}-order filter, got {len(__SCREAMING_SNAKE_CASE       )}"""
    )
    raise ValueError(__SCREAMING_SNAKE_CASE       )

   if len(__SCREAMING_SNAKE_CASE       ) != self.order + 1:
    __a       =  (
        f"""Expected b_coeffs to have {self.order + 1} elements """
        f"""for {self.order}-order filter, got {len(__SCREAMING_SNAKE_CASE       )}"""
    )
    raise ValueError(__SCREAMING_SNAKE_CASE       )

   __a       =  a_coeffs
   __a       =  b_coeffs

  def 		_UpperCAmelCase   (		self :      Optional[Any]     ,							__SCREAMING_SNAKE_CASE :      float       ):
   __a       =  0.0

   # Start at index 1 and do index 0 at the end.
   for i in range(1     ,							self.order + 1       ):
    result += (
        self.b_coeffs[i] * self.input_history[i - 1]
        - self.a_coeffs[i] * self.output_history[i - 1]
    )

   __a       =  (result + self.b_coeffs[0] * sample) / self.a_coeffs[0]

   __a       =  self.input_history[:-1]
   __a       =  self.output_history[:-1]

   __a       =  sample
   __a       =  result

   return result


