'''simple docstring'''

from __future__ import annotations


def __a (	__lowerCamelCase			:						list[int]				)	->							int:
      '''simple docstring'''


      lowercase_     =      len(__lowerCamelCase				) // 2

      # choose the middle 3 elements
      lowercase_     =      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()







'''simple docstring'''

from __future__ import annotations


def __a (	__lowerCamelCase			:						int				)	->							list[int]:
      '''simple docstring'''


      lowercase_     =      [True] * limit
      lowercase_     =      False
      lowercase_     =      False
      lowercase_     =      True

      for i in range(3 ,		int(limit**0.5 + 1				) ,		2				):
            lowercase_     =      i * 2
            while index < limit:
                  lowercase_     =      False
                  lowercase_     =      index + i

      lowercase_     =      [2]

      for i in range(3 ,		__lowerCamelCase ,		2				):
            if is_prime[i]:
                  primes.append(__lowerCamelCase				)

      return primes


def __a (	__lowerCamelCase			:						int = 1_000_000				)	->							int:
      '''simple docstring'''


      lowercase_     =      prime_sieve(__lowerCamelCase				)
      lowercase_     =      0
      lowercase_     =      0

      for i in range(len(__lowerCamelCase				)				):
            for j in range(i + length ,		len(__lowerCamelCase				)				):
                  lowercase_     =      sum(primes[i:j]				)
                  if sol >= ceiling:
                        break

                  if sol in primes:
                        lowercase_     =      j - i
                        lowercase_     =      sol

      return largest


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






