class Solution {
    /**
     * @param A: An integers array.
     * @return: return any of peek positions.
     */
    public int findPeak(int[] A) {
        for(int i=1;i<A.length;i++){
            if(A[i]>=A[i+1]) return i;
        }
        return -1;
    }
}