import sys


def solution(A):
    iPosition = -1
    jPosition = -1
    kPosition = -1
    misMatchCount = 0
    for i in range(len(A) - 1):
        if A[i] > A[i + 1]:
            iPosition = i
            break

    for j in range(len(A) - 1, 0, -1):
        if A[j] < A[j - 1]:
            jPosition = j
            break

    for k in range(iPosition, len(A) - 1):
        if A[k] > A[iPosition]:
            kPosition = k - 1
            break

    if iPosition != -1 and jPosition != -1:
        misMatchCount = max(misMatchCount, max(jPosition, kPosition) - iPosition + 1)
    return misMatchCount


print(solution([1]))
print(solution([1,2]))
print(solution([3,2]))
print(solution([10, 9, 8, 7, 5, 4, 3, 2, 1]))
print(solution([1,2,6,5,5,8,9,4, 10]))
print(solution([10, 9, 8, 7, 5, 4, 3, 2, 1, 0]))