class Solution {
    public int minArray(int[] numbers) {
        int len=numbers.length;
        if(len<1)
             return-1;
        for(int i=1;i<=len-1;i++){
            if(numbers[i-1]>numbers[i]){
                return numbers[i];
            }
        }
        return numbers[0];
    }
}