"""simple docstring"""






__A			   = {
    "a": "AAAAA",
    "b": "AAAAB",
    "c": "AAABA",
    "d": "AAABB",
    "e": "AABAA",
    "f": "AABAB",
    "g": "AABBA",
    "h": "AABBB",
    "i": "ABAAA",
    "j": "BBBAA",
    "k": "ABAAB",
    "l": "ABABA",
    "m": "ABABB",
    "n": "ABBAA",
    "o": "ABBAB",
    "p": "ABBBA",
    "q": "ABBBB",
    "r": "BAAAA",
    "s": "BAAAB",
    "t": "BAABA",
    "u": "BAABB",
    "v": "BBBAB",
    "w": "BABAA",
    "x": "BABAB",
    "y": "BABBA",
    "z": "BABBB",
    " ": " ",
}


__A			   = {value: key for key, value in encode_dict.items()}



def SCREAMING_SNAKE_CASE__			(   __UpperCAmelCase )  ->  int:
   lowercase__:   Union[str, Any]					=      ""
   for letter in word.lower():
      if letter.isalpha() or letter == " ":
         encoded += encode_dict[letter]
      else:
         raise Exception('''encode() accepts only letters of the alphabet and spaces''' )
   return encoded



def SCREAMING_SNAKE_CASE__			(   __UpperCAmelCase )  ->  Dict:
   if set(UpperCamelCase__ ) - {"A", "B", " "} != set():
      raise Exception('''decode() accepts only \'A\', \'B\' and spaces''' )
   lowercase__:   Optional[int]					=      ""
   for word in coded.split():
      while len(UpperCamelCase__ ) != 0:
         decoded += decode_dict[word[:5]]
         lowercase__:   Optional[int]					=      word[5:]
      decoded += " "
   return decoded.strip()


if __name__ == "__main__":
       from doctest import testmod

       testmod()




def 							_UpperCAmelCase				(UpperCamelCase__     :  Optional[Any]				,							UpperCamelCase__     :  Union[str, Any]						):
       # "extended trapezoidal rule"
       # int(f) = dx/2 * (f1 + 2f2 + ... + fn)
       _A      :       int				    = (boundary[1] - boundary[0]) / steps
       _A      :       Any				    = boundary[0]
       _A      :       List[Any]				    = boundary[1]
       _A      :       str				    = make_points(UpperCamelCase__				,							UpperCamelCase__				,							UpperCamelCase__						)
       _A      :       str				    = 0.0
       y += (h / 2.0) * f(UpperCamelCase__						)
       for i in x_i:
              # print(i)
              y += h * f(UpperCamelCase__						)
       y += (h / 2.0) * f(UpperCamelCase__						)
       return y
def 							_UpperCAmelCase				(UpperCamelCase__     :  List[str]				,							UpperCamelCase__     :  Optional[int]				,							UpperCamelCase__     :  Any						):
       _A      :       Optional[int]				    = a + h
       while x < (b - h):
              yield x
              _A      :       Dict				    = x + h
def 							_UpperCAmelCase				(UpperCamelCase__     :  Optional[int]						):  # enter your function here
       _A      :       Any				    = (x - 0) * (x - 0)
       return y
def 							_UpperCAmelCase				():
       _A      :       Optional[Any]				    = 0.0  # Lower bound of integration
       _A      :       Optional[int]				    = 1.0  # Upper bound of integration
       _A      :       List[Any]				    = 10.0  # define number of steps or resolution
       _A      :       Any				    = [a, b]  # define boundary of integration
       _A      :       Tuple				    = method_a(UpperCamelCase__				,							UpperCamelCase__						)
       print(f"y = {y}"						)


if __name__ == "__main__":
    main()
