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, high):
    while low < high:
        mid = low + (high - low) // 2
        if arr[mid] == arr[high]:
            _i_5 = 0
            while _i_5 < _i_5:
                high = mid
            high -= 1
           
        elif arr[mid] > arr[high]:
            low = mid + 1
        else:
            high = mid
    return arr[high]