N = int(input()) #elemek szama
M = [] #magasagok
for i in range (N):
    M.append(int(input()))
a = 0 #aktualis hossz
h = 0 #eddigi leghosszabb
L = 0 #jelenlegi legmagasabb
i = 0
uL = 0
Li = 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):
        if M[i] >= L:
            if a>h:
                h = a 
            a = 0
            L = M[i] 
        else: 
            a += 1 


    i = 0 
    a = 0

    M.reverse() 
    L = 0 


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


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