a = 0 #aktualis hosszusag
h = 0 #leghosszabb
uL = 0 #utolso leghosszabb
Li = 0 #legmagasabb indexe
i = 0 #index
aL = 0 #aktialis legmagasabb
N = int(input())
M = []
for i in range(N):
    M.append(int(input()))

i = 0
if N > 2:
    for i in range(N): #megkeressuk a legmagasabbat, tobb eseten az utolsot
        if M[i] >= uL:
            uL = M[i]
            Li = i+1
        else:
            continue

    i = 0

    for i in range(Li): #elorol szamitott leghosszabb 
        if M[i] >= aL:
            if a>h:
                h = a
            a = 0
            aL = M[i]
        else:
            a += 1

    i = 0
    a = 0

    M.reverse()

    for i in range(N-Li):
        if M[i] >= aL:
            aL = M[i]
            if a>h:
                h = a
        else:
            a += 1


if h == 0:
    print("-1")
else:   
    print(h)