




"""simple docstring"""




from __future__ import annotations

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase)      ->					int:
     a     =				len(lowerCamelCase_) // 2

     # choose the middle 3 elements
     a     =				lst[m - 1 : m + 2]

     # if middle element is peak
     if three[1] > three[0] and three[1] > three[2]:
          return three[1]

     # if increasing, recurse on right
     elif three[0] < three[2]:
          if len(lst[:m]) == 2:
               m -= 1
          return peak(lst[m:])

     # decreasing
     else:
          if len(lst[:m]) == 2:
               m += 1
          return peak(lst[:m])


if __name__ == "__main__":
   import doctest

   doctest.testmod()







from __future__ import annotations

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase)      ->					list[int]:
     a     =				2
     a     =				[]
     while i * i <= n:
          if n % i:
               i += 1
          else:
               n //= i
               factors.append(__UpperCamelCase)
     if n > 1:
          factors.append(__UpperCamelCase)
     return factors


if __name__ == "__main__":
   import doctest

   doctest.testmod()

