class Solution:
def minArray(self, numbers: List[int]) -> int:
n = len(numbers)
left, right = 0, n - 1
while left < right:
mid = (left + right) // 2
if numbers[mid] < numbers[right]:
right = mid
elif numbers[mid] > numbers[right]:
left = mid + 1
else: # numbers[mid] == numbers[right]
right -= 1
return numbers[left]