def find_Min(arr,low,high):
     
    while (low < high): 
        mid = low + (high - low) // 2;   
        if (arr[mid] == arr[high]): 
            high -= 1; 
        elif (arr[mid] > arr[high]): 
            low = mid + 1; 
        else: 
            high = mid; 
    return arr[high]; 
def find_Min(arr, low, VAR_0):
    while low < VAR_0:
        mid = low + (VAR_0 - low) // 2
        if arr[mid] == arr[VAR_0]:
            VAR_0 -= 1
           
        elif arr[mid] > arr[VAR_0]:
            low = mid + 1
        else:
            VAR_0 = mid
    return arr[VAR_0]